Tight approximations for resource constrained scheduling and bin packing
- 27 November 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 79 (1-3) , 223-245
- https://doi.org/10.1016/s0166-218x(97)00045-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithmic Chernoff‐Hoeffding inequalities in integer programmingRandom Structures & Algorithms, 1996
- Simulating (log c n )-wise independence in NCJournal of the ACM, 1991
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Errata: `` Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems''Journal of the ACM, 1977
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer SystemsJournal of the ACM, 1975