1. Guest editor’s foreword

   • M. X. Goemans

   EditorialNotes Pages: 1 - 2

2. Primal-dual approximation algorithms for integral flow and multicut in trees

   • N. Garg
   • V. V. Vazirani
   • M. Yannakakis

   OriginalPaper Pages: 3 - 20

3. An approximation algorithm for minimum-cost vertex-connectivity problems

   • R. Ravi
   • D. P. Williamson

   OriginalPaper Pages: 21 - 43

4. Randomized approximation of bounded multicovering problems

   • D. Peleg
   • G. Schechtman
   • A. Wool

   OriginalPaper Pages: 44 - 66

5. Improved approximation algorithms for MAXk-CUT and MAX BISECTION

   • A. Frieze
   • M. Jerrum

   OriginalPaper Pages: 67 - 81

6. On approximating the longest path in a graph

   • D. Karger
   • R. Motwani
   • G. D. S. Ramkumar

   OriginalPaper Pages: 82 - 98

7. A series of approximation algorithms for the acyclic directed steiner tree problem

   • A. Zelikovsky

   OriginalPaper Pages: 99 - 110

8. AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane

   • N. Garg
   • D. S. Hochbaum

   OriginalPaper Pages: 111 - 121

9. An algorithm for the three-dimensional packing problem with asymptotic performance analysis

   • F. K. Miyazawa
   • Y. Wakabayashi

   OriginalPaper Pages: 122 - 144

10. Greed is good: Approximating independent sets in sparse and bounded-degree graphs

    • M. M. Halldórsson
    • J. Radhakrishnan

    OriginalPaper Pages: 145 - 163