Guest Editors’ Introduction Klaus JansenSamir Khuller OriginalPaper 08 December 2003 Pages: 415 - 416
Approximation Algorithms for a Capacitated Network Design Problem Refael HassinR. RaviF. Sibel Salman OriginalPaper 08 December 2003 Pages: 417 - 431
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem Kamal JainVijay V. Vazirani OriginalPaper 12 December 2003 Pages: 433 - 439
Improved Approximations for Tour and Tree Covers Jochen KönemannGoran KonjevodAmitabh Sinha OriginalPaper 05 December 2003 Pages: 441 - 449
Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses Venkatesan Guruswami OriginalPaper 05 December 2003 Pages: 451 - 469
The Relative Complexity of Approximate Counting Problems Martin DyerLeslie Ann GoldbergMark Jerrum OriginalPaper 10 December 2003 Pages: 471 - 500
Maximum Dispersion and Geometric Maximum Weight Cliques Sándor P. FeketeHenk Meijer OriginalPaper 05 December 2003 Pages: 501 - 511