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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bongiovanni, Giancarlo (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Gambosi, Giorgio (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Petreschi, Rosella (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1767
• Θέματα: Computer programming.; Data structures (Computer science).; Algorithms.; Computers.; Computer science-Mathematics.; Programming Techniques.; Data Structures and Information Theory.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Data Structures.; Discrete Mathematics in Computer Science.

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...

Πίνακας περιεχομένων:

• 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.