Primal-dual approximation algorithms for integral flow and multicut in trees N. GargV. V. VaziraniM. Yannakakis OriginalPaper Pages: 3 - 20
An approximation algorithm for minimum-cost vertex-connectivity problems R. RaviD. P. Williamson OriginalPaper Pages: 21 - 43
Randomized approximation of bounded multicovering problems D. PelegG. SchechtmanA. Wool OriginalPaper Pages: 44 - 66
Improved approximation algorithms for MAXk-CUT and MAX BISECTION A. FriezeM. Jerrum OriginalPaper Pages: 67 - 81
On approximating the longest path in a graph D. KargerR. MotwaniG. D. S. Ramkumar OriginalPaper Pages: 82 - 98
A series of approximation algorithms for the acyclic directed steiner tree problem A. Zelikovsky OriginalPaper Pages: 99 - 110
AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane N. GargD. S. Hochbaum OriginalPaper Pages: 111 - 121
An algorithm for the three-dimensional packing problem with asymptotic performance analysis F. K. MiyazawaY. Wakabayashi OriginalPaper Pages: 122 - 144
Greed is good: Approximating independent sets in sparse and bounded-degree graphs M. M. HalldórssonJ. Radhakrishnan OriginalPaper Pages: 145 - 163
