Algorithmica, Volume 18, 1997

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

• Yui-Bin Chen, Doug Ierardi:
  Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints. 165-197
  
• Kuo-Hui Tsai, D. T. Lee:
  k Best Cuts for Circular-Arc Graphs. 198-216
  
• L. Paul Chew, Steven Fortune:
  Sorting Helps for Voronoi Diagrams. 217-228
  
• Takeshi Tokuyama:
  Orthogonal Queries in Segments. 229-245
  
• Mark H. Overmars, Nicola Santoro:
  Improved Bounds for Electing a Leader in a Synchronous Ring. 246-262
  
• Valerie King:
  A Simpler Minimum Spanning Tree Verification Algorithm. 263-270
  
• Stephen V. Rice, Horst Bunke, Thomas A. Nartker:
  Classes of Cost Functions for String Edit Distance. 271-280
  

Volume 18, Number 3, July 1997

• Susanne Albers:
  On the Influence of Lookahead in Competitive Paging Algorithms. 283-305
  
• Mark de Berg, Marc J. van Kreveld:
  Trekking in the Alps Without Freezing or Getting Tired. 306-323
  
• Robert F. Cohen, Roberto Tamassia:
  Combine and Conquer. 324-362
  
• Karsten Weihe:
  Multicommodity Flows in Even, Planar Networks. 363-383
  
• Vijaya Ramachandran, Honghua Yang:
  An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. 384-404
  
• Ornan Ori Gerstel, Shmuel Zaks:
  The Bit Complexity of Distributed Sorting. 405-416
  
• Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn:
  Routing on Meshes with Buses. 417-444
  
• Ernst W. Mayr, Ralph Werchner:
  Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks. 445-460
  

Volume 18, Number 4, August 1997

• William R. Burley, Sandy Irani:
  On Algorithm Design for Metrical Task Systems. 461-485
  
• Shlomi Dolev, Jennifer L. Welch:
  Wait-Free Clock Synchronization. 486-511
  
• S. Muthukrishnan:
  Detecting False Matches in String-Matching Algorithms. 512-520
  
• Robert Beals:
  Equivalence of Binary and Ternary Algebraic Decision Trees. 521-523
  
• Sergei Bespamyatnikh:
  On Constructing Minimum Spanning Trees in R^k_l. 524-529
  
• T. Matsui:
  A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs. 530-543
  
• Celina Imielinska, Bahman Kalantari:
  A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors. 544-559
  
• Peichen Pan, Sai-keung Dong, C. L. Liu:
  Optimal Graph Constraint Reduction for Symbolic Layout Compaction. 560-574
  

Last update Sat May 18 20:01:14 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page