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