+612 9045 4394
 
CHECKOUT
Algorithms and Complexity : 4th Italian Conference, CIAC 2000, Rome, Italy, March 1-3, 2000, Proceedings :  4th Italian Conference, CIAC 2000, Rome, Italy, March 1-3, 2000, Proceedings - Giancarlo Bongiovanni

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

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

By: Giancarlo Bongiovanni (Editor), Giorgio Gambosi (Editor), Rosella Petreschi (Editor), Gail L. Bongiovanni (Editor)

Paperback Published: March 2000
ISBN: 9783540671596
Number Of Pages: 324

Share This Book:

Paperback

$135.51
or 4 easy payments of $33.88 with Learn more
Ships in 15 business days

Earn 271 Qantas Points
on this Book

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.

Invited Presentations
On Salesmen, Repairmen, Spiders, and Other Traveling Agentsp. 1
Computing a Diameter-Constrained Minimum Spanning Tree in Parallelp. 17
Algorithms for a Simple Point Placement Problemp. 32
Duality in ATM Layout Problemsp. 44
Regular Presentations
The Independence Number of Random Interval Graphsp. 59
Online Strategies for Backupsp. 63
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problemp. 72
Semantical Counting Circuitsp. 87
The Hardness of Placing Street Names in a Manhattan Type Mapp. 102
Labeling Downtownp. 113
The Online Dial-a-Ride Problem under Reasonable Loadp. 125
The Online-TSP against Fair Adversariesp. 137
QuickHeapsort, an Efficient Mix of Classical Sorting Algorithmsp. 150
Triangulations without Minimum-Weight Drawingp. 163
Faster Exact Solutions for Max2Satp. 174
Dynamically Maintaining the Widest k-Dense Corridorp. 187
Reconstruction of Discrete Sets from Three or More X-Raysp. 199
Modified Binary Searching for Static Tablesp. 211
An Efficient Algorithm for the Approximate Median Selection Problemp. 226
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classesp. 239
Group Updates for Red-Black Treesp. 253
Approximating SVP8 to within Almost-Polynomial Factors Is NP-Hardp. 263
Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problemsp. 277
On the Lovász Number of Certain Circulant Graphsp. 291
Speeding Up Pattern Matching by Text Compressionp. 306
Author Indexp. 317
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540671596
ISBN-10: 3540671595
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 324
Published: March 2000
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 1.75
Weight (kg): 0.47

Earn 271 Qantas Points
on this Book