Journal of Algorithms, Volume 29

Volume 29, Number 1, October 1998

Al Borchers, Ding-Zhu Du, Biao Gao, Peng-Jun Wan: The k-Steiner Ratio in the Rectilinear Plane. 1-17 BibTeX
Dany Breslauer, Livio Colussi, Laura Toniolo: On the Comparison Complexity of the String Prefix-Matching Problem. 18-67 BibTeX
Sanguthevar Rajasekaran: Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses. 68-81 BibTeX
Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. 82-110 BibTeX
Paul E. Kearney, Derek G. Corneil: Tree Powers. 111-131 BibTeX
Hsueh-I Lu, R. Ravi: Approximating Maximum Leaf Spanning Trees in Almost Linear Time. 132-141 BibTeX
Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin: Optimal Constructions of Hybrid Algorithms. 142-164 BibTeX
Timothy R. Walsh: Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time. 165-173 BibTeX
Dorit S. Hochbaum: Approximating Clique and Biclique Problems. 174-200 BibTeX

Kenneth L. Clarkson: SODA '95 Papers. 203 BibTeX
Baruch Schieber: Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property. 204-222 BibTeX
Sampath Kannan, Todd A. Proebsting: Register Allocation in Structured Programs. 223-237 BibTeX
L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. 238-255 BibTeX
Arne Andersson, Ola Petersson: Approximate Indexed Lists. 256-276 BibTeX
George S. Lueker: Average-Case Analysis of Off-Line and On-Line Knapsack Problems. 277-305 BibTeX
Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts: Fairness in Scheduling. 306-357 BibTeX
William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan: Design of Practical and Provably Good Random Number Generators. 358-389 BibTeX
Nabil Kahale, Frank Thomson Leighton: Greedy Dynamic Routing on Arrays. 390-410 BibTeX