| 3 | -- | 20 | Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees |
| 21 | -- | 43 | R. Ravi, David P. Williamson. An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems |
| 44 | -- | 66 | David Peleg, Gideon Schechtman, Avishai Wool. Randomized Approximation of Bounded Multicovering Problems |
| 67 | -- | 81 | Alan M. Frieze, Mark Jerrum. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION |
| 82 | -- | 98 | David R. Karger, Rajeev Motwani, G. D. S. Ramkumar. On Approximating the Longest Path in a Graph |
| 99 | -- | 110 | Alexander Zelikovsky. A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem |
| 111 | -- | 121 | Naveen Garg, Dorit S. Hochbaum. An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane |
| 122 | -- | 144 | Flávio Keidi Miyazawa, Yoshiko Wakabayashi. An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis |
| 145 | -- | 163 | Magnús M. Halldórsson, Jaikumar Radhakrishnan. Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs |