1. Guest Editors’ Introduction

   • Klaus Jansen
   • Samir Khuller

   OriginalPaper 08 December 2003 Pages: 415 - 416

2. Approximation Algorithms for a Capacitated Network Design Problem

   • Refael Hassin
   • R. Ravi
   • F. Sibel Salman

   OriginalPaper 08 December 2003 Pages: 417 - 431

3. An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem

   • Kamal Jain
   • Vijay V. Vazirani

   OriginalPaper 12 December 2003 Pages: 433 - 439

4. Improved Approximations for Tour and Tree Covers

   • Jochen Könemann
   • Goran Konjevod
   • Amitabh Sinha

   OriginalPaper 05 December 2003 Pages: 441 - 449

5. Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses

   • Venkatesan Guruswami

   OriginalPaper 05 December 2003 Pages: 451 - 469

6. The Relative Complexity of Approximate Counting Problems

   • Martin Dyer
   • Leslie Ann Goldberg
   • Mark Jerrum

   OriginalPaper 10 December 2003 Pages: 471 - 500

7. Maximum Dispersion and Geometric Maximum Weight Cliques

   • Sándor P. Fekete
   • Henk Meijer

   OriginalPaper 05 December 2003 Pages: 501 - 511