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

ISBN-13: 9783540671596 / Angielski / Miękka / 2000 / 324 str.

G. Bongiovanni; R. Petreschi; G. Gambosi

Opis

This text constitutes the refereed proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, in March 2000. The 21 revised full papers presented were carefully reviewed and selected from 41 submissions, also included are four invited survey papers. Among the topics addressed are: combinatorial optimization; graph algorithms; graph computations; complexity theory; diagram design; approximation; scheduling; sorting; computational geometry; searching; and pattern matching.

Spis treści

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.

O autorze

Rossella Petreschi is Professor in the Dipartimento di Informatica, Università di Roma 'La Sapienza', where she was a founding faculty member and the director from 2003-009. She cofounded the International Conference on Algorithms and Complexity (CIAC), and she coauthored many formal academic journal and conference publications. Her research interests include algorithm design and analysis, parallel and distributed computing, efficient solutions of graph problems, labelled tree encodings, and frequency assignments in wireless networks. She has also researched and published on graph drawing, interconnection topologies and experimental algorithmics. Many of her former students occupy key positions in industry and research.