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

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

by Giancarlo Bongiovanni
     
 

ISBN-10: 3540671595

ISBN-13: 9783540671596

Pub. Date: 03/15/2000

Publisher: Springer Berlin Heidelberg

This book constitutes the refereed proceedings of the 4th Italian Conf erence on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, i n March 2000. The 21 revised full papers presented were carefully revi ewed and selected from 41 submissions; also included are four invited survey papers. Among the topics addressed are combinatorial optimizati on, graph

…  See more details below

Overview

This book constitutes the refereed proceedings of the 4th Italian Conf erence on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, i n March 2000. The 21 revised full papers presented were carefully revi ewed and selected from 41 submissions; also included are four invited survey papers. Among the topics addressed are combinatorial optimizati on, graph algorithms, graph computations, complexity theory, diagram d esign, approximation, scheduling, sorting, computational geometry, sea rching, and pattern matching

Product Details

ISBN-13:
9783540671596
Publisher:
Springer Berlin Heidelberg
Publication date:
03/15/2000
Series:
Lecture Notes in Computer Science Series, #1767
Edition description:
2000
Pages:
324
Product dimensions:
9.21(w) x 6.14(h) x 0.69(d)

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.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >