Probabilistic analysis for scheduling with conflicts

Authors:
Sandy Irani;Vitus Leung
Affiliations:
Dept. of Info. and Comp. Science, University of California, Irvine, CA;Dept. of Info. and Comp. Science, University of California, Irvine, CA
Venue:
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Year:
1997

On the hardness of approximating minimization problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Scheduling with conflicts, and applications to traffic signal control

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Sum Multi-coloring of Graphs

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Multiagent Traffic Management: A Reservation-Based Intersection Control Mechanism

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2

Hi-index	0.00