Algorithms and Complexity

4th Italian Conference, CIAC 2000 Rome, Italy, March 1-3, 2000 Proceedings

AvGiancarlo Bongiovanni,Giorgio Gambosi

Häftad, Engelska, 2000

Del i serien Lecture Notes in Computer Science

561 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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

Produktinformation

Utgivningsdatum:2000-02-16
Mått:155 x 235 x undefined mm
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:324
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540671596

Utforska kategorier

Databaser inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Algorithms and Complexity

Rosella Petreschi, Giorgio Gambosi, Giancarlo Bongiovanni

E-bok

2003

687 kr

Algorithms and Complexity

Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri

Häftad, 2003

544 kr

Complexity and Approximation

Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi

Häftad, 2013

759 kr

Complexity and Approximation

Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi, Giorgio Ausiello, Pierluigi Crescenzi

Inbunden, 1999

920 kr