Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings

Algorithms and Complexity

6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings

Calamoneri, Tiziana, Finocchi, Irene, Italiano, Guiseppe F. (Eds.)

2006, XII, 394 p. Also available online.

Available Formats:
eBook
Information

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.

 
$89.99

(net) price for USA

ISBN 978-3-540-34378-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

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.

 
$119.00

(net) price for USA

ISBN 978-3-540-34375-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

This book constitutes the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006, held in Rome, Italy, in May 2006.

The 33 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 80 submissions. Among the topics addressed are sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.

Content Level » Research

Keywords » algorithm - algorithms - complexity - computational geometry - data structure - data structures - game theory - optimization - programming

Related subjects » Image Processing - Theoretical Computer Science

Table of contents 

Invited Talks.- Reliable and Efficient Geometric Computing.- Beware of the Model: Reflections on Algorithmic Research.- On Search Problems in Complexity Theory and in Logic (Abstract).- Session 1.- Covering a Set of Points with a Minimum Number of Lines.- Approximation Algorithms for Capacitated Rectangle Stabbing.- In-Place Randomized Slope Selection.- Session 2.- Quadratic Programming and Combinatorial Minimum Weight Product Problems.- Counting All Solutions of Minimum Weight Exact Satisfiability.- Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms.- Session 3.- Network Discovery and Verification with Distance Queries.- Deciding the FIFO Stability of Networks in Polynomial Time.- Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates.- Session 4.- Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups.- Gathering Algorithms on Paths Under Interference Constraints.- On the Hardness of Range Assignment Problems.- Session 5.- Black Hole Search in Asynchronous Rings Using Tokens.- On Broadcast Scheduling with Limited Energy.- A Near Optimal Scheduler for On-Demand Data Broadcasts.- Session 6.- Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines.- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases.- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.- Session 7.- Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems.- An Approximation Algorithm for a Bottleneck Traveling Salesman Problem.- On the Minimum Common Integer Partition Problem.- Session 8.- Matching Subsequences in Trees.- Distance Approximating Trees: Complexity and Algorithms.- How to Pack Directed Acyclic Graphs into Small Blocks.- Session 9.- On-Line Coloring of H-Free Bipartite Graphs.- Distributed Approximation Algorithms for Planar Graphs.- A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small.- Session 10.- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.- Parameterized Algorithms for Hitting Set: The Weighted Case.- Fixed-Parameter Tractable Generalizations of Cluster Editing.- Session 11.- The Linear Arrangement Problem Parameterized Above Guaranteed Value.- Universal Relations and #P-Completeness.- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.