Algorithms and Complexity: 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / Edition 1

Algorithms and Complexity: 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings / Edition 1

by Rosella Petreschi, Giuseppe Persiano, Riccardo Silvestri
     
 

ISBN-10: 3540401768

ISBN-13: 9783540401766

Pub. Date: 08/05/2003

Publisher: Springer Berlin Heidelberg

This book constitutes the refereed proceedings of the 5th Italian Conference on Algorithms and Computation, CIAC 2003, held in Rome, Italy in May 2003. The 23 revised full papers presented were carefully reviewed and selected from 57 submissions. Among the topics addressed are complexity, complexity theory, geometric computing, matching, online algorithms,

Overview

This book constitutes the refereed proceedings of the 5th Italian Conference on Algorithms and Computation, CIAC 2003, held in Rome, Italy in May 2003. The 23 revised full papers presented were carefully reviewed and selected from 57 submissions. Among the topics addressed are complexity, complexity theory, geometric computing, matching, online algorithms, combinatorial optimization, computational graph theory, approximation algorithms, network algorithms, routing, and scheduling.

Product Details

ISBN-13:
9783540401766
Publisher:
Springer Berlin Heidelberg
Publication date:
08/05/2003
Series:
Lecture Notes in Computer Science Series, #2653
Edition description:
2003
Pages:
290
Product dimensions:
6.10(w) x 9.17(h) x 0.03(d)

Table of Contents

Tutorials.- Localized Network Representations.- Optimal Binary Search Trees with Costs Depending on the Access Paths.- On the Generation of Extensions of a Partially Ordered Set.- Error-Correcting Codes in Complexity Theory.- Invited Talks.- Cache-Oblivious Algorithms.- Spanning Trees with Low Maximum/Average Stretch.- Hyper Encryption and Everlasting Secrets.- Computing with Electronic Nanotechnologies.- Regular Contribution.- Efficient Update Strategies for Geometric Computing with Uncertainty.- Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete.- An Improved Algorithm for Point Set Pattern Matching under Rigid Motion.- Unlocking the Advantages of Dynamic Service Selection and Pricing.- The Relative Worst Order Ratio for On-Line Algorithms.- On-Line Stream Merging, Max Span, and Min Coverage.- Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs.- Additive Spanners for k-Chordal Graphs.- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.- Reconciling Gene Trees to a Species Tree.- Generating All Forest Extensions of a Partially Ordered Set.- Indexing Structures for Approximate String Matching.- Approximation Hardness for Small Occurrence Instances of NP-Hard Problems.- Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory.- Approximation of a Retrieval Problem for Parallel Disks.- On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.- The Complexity of Detecting Fixed-Density Clusters.- Nearly Bounded Error Probabilistic Sets.- Some Properties of MODm Circuits Computing Simple Functions.- XOR-Based Schemes for Fast Parallel IP Lookups.- The Impact of Network Structure on the Stability of Greedy Prools.- Improving Customer Proximity to Railway Stations.- Differential Approximation for Some Routing Problems.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >