| 415 | -- | 416 | Klaus Jansen, Samir Khuller. Guest Editors Introduction |
| 417 | -- | 431 | Refael Hassin, R. Ravi, F. Sibel Salman. Approximation Algorithms for a Capacitated Network Design Problem |
| 433 | -- | 439 | Kamal Jain, Vijay V. Vazirani. An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem |
| 441 | -- | 449 | Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha. Improved Approximations for Tour and Tree Covers |
| 451 | -- | 469 | Venkatesan Guruswami. Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses |
| 471 | -- | 500 | Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum. The Relative Complexity of Approximate Counting Problems |
| 501 | -- | 511 | Sándor P. Fekete, Henk Meijer. Maximum Dispersion and Geometric Maximum Weight Cliques |