Algorithms and Complexity 4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings
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 mee...
Other Authors: | , , |
---|---|
Format: | eBook |
Language: | English |
Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2000, 2000
|
Edition: | 1st ed. 2000 |
Series: | Lecture Notes in Computer Science
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Invited Presentations
- On Salesmen, Repairmen, Spiders, and Other Traveling Agents
- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
- Algorithms for a Simple Point Placement Problem
- Duality in ATM Layout Problems
- Regular Presentations
- The Independence Number of Random Interval Graphs
- Online Strategies for Backups
- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
- Semantical Counting Circuits
- The Hardness of Placing Street Names in a Manhattan Type Map
- Labeling Downtown
- The Online Dial-a-Ride Problem under Reasonable Load
- The Online-TSP against Fair Adversaries
- QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
- Triangulations without Minimum-Weight Drawing
- Faster Exact Solutions for Max2Sat
- Dynamically Maintaining the Widest k-Dense Corridor
- Reconstruction of Discrete Sets from Three or More X-Rays
- Modified Binary Searching for Static Tables
- An Efficient Algorithm for the Approximate Median Selection Problem
- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
- Group Updates for Bed-Black Trees
- Approximating SVP ? to within Almost-Polynomial Factors Is NP-Hard
- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems
- On the Lovász Number of Certain Circulant Graphs
- Speeding Up Pattern Matching by Text Compression