Algorithms and Complexity: 4th Italian Conference, CIAC 2000 Rome, Italy, March 1–3, 2000 Proceedings

Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela (auth.), Giancarlo Bongiovanni, Rossella Petreschi, Giorgio Gambosi (eds.)3540671595, 9783540671596

The papers in this volume were presented at the Fourth Italian Conference on Algorithms and Complexity (CIAC 2000). The conference took place on March 1-3, 2000, in Rome (Italy), at the conference center of the University of Rome La Sapienza”. This conference was born in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity, and parallel and distributed computing. Due to a signi cant participation of foreign reaserchers, starting from the second conference, CIAC evolved into an international conference. In response to the call for papers for CIAC 2000, there were 41 subm- sions, from which the program committee selected 21 papers for presentation at the conference. Each paper was evaluated by at least three program committee members. In addition to the selected papers, the organizing committee invited Giorgio Ausiello, Narsingh Deo, Walter Ruzzo, and Shmuel Zaks to give plenary lectures at the conference. We wish to express our appreciation to all the authors of the submitted papers, to the program committee members and the referees, to the organizing committee, and to the plenary lecturers who accepted our invitation.

---

Table of contents :
On Salesmen, Repairmen, Spiders, and Other Traveling Agents….Pages 1-16
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel….Pages 17-31
Algorithms for a Simple Point Placement Problem….Pages 32-43
Duality in ATM Layout Problems….Pages 44-58
The Independence Number of Random Interval Graphs….Pages 59-62
Online Strategies for Backups….Pages 63-71
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem….Pages 72-86
Semantical Counting Circuits….Pages 87-101
The Hardness of Placing Street Names in a Manhattan Type Map….Pages 102-112
Labeling Downtown….Pages 113-124
The Online Dial-a-Ride Problem under Reasonable Load….Pages 125-136
The Online-TSP against Fair Adversaries….Pages 137-149
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms….Pages 150-162
Triangulations without Minimum-Weight Drawing….Pages 163-173
Faster Exact Solutions for M ax 2S at ….Pages 174-186
Dynamically Maintaining the Widest k -Dense Corridor….Pages 187-198
Reconstruction of Discrete Sets from Three or More X-Rays….Pages 199-210
Modified Binary Searching for Static Tables….Pages 211-225
An Efficient Algorithm for the Approximate Median Selection Problem….Pages 226-238
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes….Pages 239-252
Group Updates for Bed-Black Trees….Pages 253-262
Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard….Pages 263-276
Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems….Pages 277-290
On the Lovász Number of Certain Circulant Graphs….Pages 291-305
Speeding Up Pattern Matching by Text Compression….Pages 306-315