Improved approximation algorithms for shop scheduling problems

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

1979 • 45,565 citations

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

1987 • 1,025 citations

Probabilistic construction of deterministic algorithms: Approximating packing integer programs

1988 • 567 citations

Sequencing and scheduling: algorithms and complexity

1989 • 263 citations

Universal packet routing algorithms

1988 • 151 citations

Provably good routing in graphs: regular arrays

1985 • 81 citations

An Algorithm for the Open-Shop Problem

1983 • 56 citations

Bounding algorithm for the routing problem with arbitrary paths and alternative servers

1987 • 31 citations