Algorithmica, Volume 31, 2001
Volume 31, Number 1, 2001
Alon Efrat, Alon Itai, Matthew J. Katz: Geometry Helps in Bottleneck Matching and Related Problems. 1-28- Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén: On-Line Competitive Algorithms for Call Admission in Optical Networks. 29-43
- R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III: Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. 58-78
- Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. 79-113
Volume 31, Number 2, 2001
- János Csirik, David S. Johnson: Bounded Space On-Line Bin Packing: Best Is Better than First. 115-138
- Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau: All-to-All Optical Routing in Chordal Rings of Degree 4. 155-178
- Neelima Gupta, Sandeep Sen: An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. 179-207
- Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda: Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. 208-236
Volume 31, Number 3, 2001
- Luc Devroye: On the Probablistic Worst-Case Time of "Find". 291-303
- Michael Drmota: The Asymptotic Number of Leftist Trees. 304-317
- Philippe Jacquet, Wojciech Szpankowski, Jing Tang: Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. 318-360
- Helmut Prodinger: A q-Analogue of the Path Length of Binary Search Trees. 433-441
Volume 31, Number 4, 2001
- Peter A. Beling: Exact Algorithms for Linear Programming over Algebraic Extensions. 459-478
- Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du: Grade of Service Steiner Minimum Trees in the Euclidean Plane. 479-500
- Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer: Relaxed Balance Using Standard Rotations. 501-512
- Ruy Luiz Milidiú, Eduardo Sany Laber: Bounding the Inefficiency of Length-Restricted Prefix Codes. 513-529
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-12-04T225754 by the dblp team