Volume 33,
Number 1,
October 1999
- David Pisinger:
Linear Time Algorithms for Knapsack Problems with Bounded Weights.
1-14 BibTeX
- Joseph Cheriyan, Ramakrishna Thurimella:
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation.
15-50 BibTeX
- Lisa Fleischer:
Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.
51-72 BibTeX
- Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems.
73-91 BibTeX
- Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Minimum Cost Spanning Trees by Upgrading Nodes.
92-111 BibTeX
- C. R. Subramanian:
Minimum Coloring k-Colorable Graphs in Polynomial Average Time.
112-123 BibTeX
- Anders Yeo:
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph.
124-139 BibTeX
- Mario A. Lopez, Shlomo Reisner:
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids.
140-165 BibTeX
- Alan M. Frieze, Michael Molloy:
Splitting an Expander Graph.
166-172 BibTeX
- Noga Alon, Benny Sudakov:
On Two Segmentation Problems.
173-184 BibTeX
Volume 33,
Number 2,
November 1999
Copyright © Sun May 17 00:06:09 2009
by Michael Ley (ley@uni-trier.de)
