Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling

Authors:
E. G. Coffman, Jr.;M. R. Garey
Affiliations:
AT&T Bell Labs., Murray Hill, NJ;AT&T Bell Labs., Murray Hill, NJ
Venue:
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Year:
1991

Citing 6
Cited 0

The two-processor scheduling problem is in R-NC

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics

Management Science
Some results on Liu's conjecture

SIAM Journal on Discrete Mathematics
Computer-Aided complexity classification of combinational problems

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial complete scheduling problems

SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles

Quantified Score

Hi-index	0.00

Visualization

Abstract