Abstract is missing.
- Approximation algorithms that take adviceSanjeev Arora. 1 [doi]
- Instant recognition of polynominal time solvability, half integrality and 2-approximationsDorit S. Hochbaum. 2-14 [doi]
- Scheduling under uncertainty: Optimizing against a randomizing adversaryRolf H. Möhring. 15-26 [doi]
- Approximation algorithms for facility location problemsDavid B. Shmoys. 27-33 [doi]
- An approximation algorithm for MAX DICUT with given sizes of partsAlexander A. Ageev, Refael Hassin, Maxim Sviridenko. 34-41 [doi]
- Maximizing job benefits on-lineBaruch Awerbuch, Yossi Azar, Oded Regev. 42-50 [doi]
- Variable length sequencing with two lengthsPiotr Berman, Junichiro Fukuyama. 51-59 [doi]
- Randomized path coloring on binary treesVincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano. 60-71 [doi]
- Wavelength rerouting in optical networks, or the Venetian routing problemAlberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan. 72-83 [doi]
- Greedy approximation algorithms for finding dense components in a graphMoses Charikar. 84-95 [doi]
- Online real-time preemptive scheduling of jobs with deadlinesBhaskar DasGupta, Michael A. Palis. 96-107 [doi]
- On the relative complexity of approximate counting problemsMartin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum. 108-119 [doi]
- On the hardness of approximating ::::N P:::: witnessesUriel Feige, Michael Langberg, Kobbi Nissim. 120-131 [doi]
- Maximum dispersion and geometric maximum weight cliquesSándor P. Fekete, Henk Meijer. 132-143 [doi]
- New results for online page replicationRudolf Fleischer, Steven S. Seiden. 144-154 [doi]
- Inapproximability results for set splitting and satisfiability problems with no mixed clausesVenkatesan Guruswami. 155-166 [doi]
- Approximation algorithms for a capacitated network design problemRefael Hassin, R. Ravi, F. Sibel Salman. 167-176 [doi]
- An approximation algorithm for the fault tolerant metric facility location problemKamal Jain, Vijay V. Vazirani. 177-183 [doi]
- Improved approximations for tour and tree coversJochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha. 184-193 [doi]
- Approximating node connectivity problems via set coversGuy Kortsarz, Zeev Nutov. 194-205 [doi]
- Rectangle tilingKrzysztof Lorys, Katarzyna E. Paluch. 206-213 [doi]
- Primal-dual approaches to the Steiner problemTobias Polzin, Siavash Vahdati Daneshmand. 214-225 [doi]
- On the inapproximability of broadcasting timeChristian Schindelhauer. 226-237 [doi]
- Polynominal time approximation schemes for class-constrained packing problemHadas Shachnai, Tami Tamir. 238-249 [doi]
- Partial servicing of on-line jobsRob van Stee, Johannes A. La Poutré. 250-261 [doi]
- Factor 4/3 approximations for minimum 2-connected subgraphsSantosh Vempala, Adrian Vetta. 262-273 [doi]