An efficient approximation algorithm for the survivable network design problem Harold N. GabowMichel X. GoemansDavid P. Williamson OriginalPaper Pages: 13 - 40
Random sampling and greedy sparsification for matroid optimization problems David R. Karger OriginalPaper Pages: 41 - 81
Packing algorithms for arborescences (and spanning trees) in capacitated graphs Harold N. GabowK. S. Manu OriginalPaper Pages: 83 - 109
An improved approximation ratio for the minimum latency problem Michel GoemansJon Kleinberg OriginalPaper Pages: 111 - 124
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases Rainer E. BurkardEranda ÇelaGerhard J. Woeginger OriginalPaper Pages: 125 - 158
Base polytopes of series—parallel posets: Linear description and optimization Rainer SchraderAndreas S. SchulzGeorg Wambach OriginalPaper Pages: 159 - 173
Makespan minimization in open shops: A polynomial time approximation scheme Sergey V. SevastianovGerhard J. Woeginger OriginalPaper Pages: 191 - 198
Minimizing average completion time in the presence of release dates Cynthia PhillipsClifford SteinJoel Wein OriginalPaper Pages: 199 - 223
Scheduling uniform machines on-line requires nondecreasing speed ratios Arjen P. A. Vestjens OriginalPaper Pages: 225 - 234
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP Jack A. A. van der VeenGerhard J. WoegingerShuzhong Zhang OriginalPaper Pages: 235 - 254
Approximation algorithms for two-machine flow shop scheduling with batch setup times Bo ChenChris N. PottsVitaly A. Strusevich OriginalPaper Pages: 255 - 271
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine Han HoogeveenSteef van de Velde OriginalPaper Pages: 273 - 289
