Logo - springer
Slogan - springer

Mathematics | Algorithms and Complexity - 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings

Algorithms and Complexity

5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings

Petreschi, Rosella, Persiano, Giuseppe, Silvestri, Riccardo

2003, X, 290 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-540-44849-5

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-40176-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • About this book

The papers in this volume were presented at the 5th Italian Conference on AlgorithmsandComplexity(CIAC2003). Theconferencetookplaceduring May 28–30, 2003, in Rome, Italy, at the Conference Centre of the University of Rome “La Sapienza. ” CIAC started in 1990 as a national meeting to be held every three years for Italian researchers in algorithms, data structures, complexity theory, and parallelanddistributedcomputing. Duetoasigni?cantparticipationofforeign researchers, starting from the second edition, CIAC evolved into an international conference. However,alltheeditionsofCIAChavebeenheldinRome. The proceedings of CIAC were published by World Scienti?c for the ?rst edition and by Springer-Verlag in the Lecture Notes in Computer Science series (volumes 778,1203and1767)forthesubsequenteditions. Aselectionofthepapersofthe fourth edition was published in a special issue of Theoretical Computer Science Vol. 285(1),2002. Thisyearweexpecttopublishanextendedversionofselected papers presented at the conference in a special issue of the journal Theory of Computing Systems. In response to the call for papers for CIAC 2003, 57 papers were subm- ted, from which the Program Committee selected 23 papers for presentation at theconferencefrom18countries. Eachpaperwasevaluatedbyatleastthree Program Committee members with the help of 63 external reviewers. In addition to the selected papers, the Organizing Committee invited CharlesE. Leiserson(Cambridge),DavidPeleg(Rehovot),MichaelO. Rabin (CambridgeandJerusalem),JohnE. Savage(Providence),andLucaTrevisan (Berkeley)togiveplenarylecturesattheconference. Moreover,threetutorials byDavidPeleg,JaymeL. Szwarc?ter(RiodeJaneiro)andLucaTrevisanwere o?ered in the days preceding the conference. We wish to express our appreciation to all the authors of the submitted - pers, to the Program Committee members and the referees, to the Organizing Committee, and to the plenary and tutorial lecturers who accepted our in- tation.

Content Level » Research

Keywords » algorithms - combinatorial optimization - combinatorics - complexity - complexity theory - computational geometry - computational graph theory - geometric algorithms - graph algorithms - graph computations - network algorithms - optimization - routing - scheduling

Related subjects » Image Processing - Mathematics - Theoretical Computer Science

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 Protocols.- Improving Customer Proximity to Railway Stations.- Differential Approximation for Some Routing Problems.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Foundations.