Algorithms and Complexity : 6th Italian Conference, Ciac 2006, Rome, Italy, May 29-31, 2006, Proceedings - Tiziana Calamoneri

Instant online reading.
Don't wait for delivery!

Algorithms and Complexity

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

By: Tiziana Calamoneri (Editor), Irene Finocchi (Editor), Guiseppe F. Italiano (Editor)

Write A Review

Paperback | 16 May 2006

At a Glance

Paperback
412 Pages

Dimensions(cm)
23.39 x 15.6 x 2.13

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as 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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Mathematical Theory of Computation Mathematics Algebra Applied Mathematics Mathematical Modelling Computer Programming & Software Development Algorithms & Data Structures Graphical & Digital Media Applications 3D Graphics & Modelling

Databases Data Capture & Analysis Graphics Programming Artificial Intelligence

Reliable and efficient geometric computing	p. 1
Beware of the model : reflections on algorithmic research	p. 3
On search problems in complexity theory and in logic (abstract)	p. 5
Covering a set of points with a minimum number of lines	p. 6
Approximation algorithms for capacitated rectangle stabbing	p. 18
In-place randomized slope selection	p. 30
Quadratic programming and combinatorial minimum weight product problems	p. 42
Counting all solutions of minimum weight exact satisfiability	p. 50
Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms	p. 60
Network discovery and verification with distance queries	p. 69
Deciding the FIFO stability of networks in polynomial time	p. 81
Heterogenous networks can be unstable at arbitrarily low injection rates	p. 93
Provisioning a virtual private network under the presence of non-communicating groups	p. 105
Gathering algorithms on paths under interference constraints	p. 115
On the hardness of range assignment problems	p. 127
Black hole search in asynchronous rings using tokens	p. 139
On broadcast scheduling with limited energy	p. 151
A near optimal scheduler for on-demand data broadcasts	p. 163
Fair cost-sharing methods for scheduling jobs on parallel machines	p. 175
Tighter approximation bounds for LPT scheduling in two special cases	p. 187
Inapproximability results for orthogonal rectangle packing problems with rotations	p. 199
Approximate hierarchical facility location and applications to the shallow Steiner tree and range assignment problems	p. 211
An approximation algorithm for a bottleneck traveling salesman problem	p. 223
On the minimum common integer partition problem	p. 236
Matching subsequences in trees	p. 248
Distance approximating trees : complexity and algorithms	p. 260
How to pack directed acyclic graphs into small blocks	p. 272
On-line coloring of J-free bipartite graphs	p. 284
Distributed approximation algorithms for planar graphs	p. 296
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small	p. 308
Fixed-parameter tractability results for feedback set problems in tournaments	p. 320
Parameterized algorithms for hitting set : the weighted case	p. 332
Fixed-parameter tractable generalizations of cluster editing	p. 344
The linear arrangement problem parameterized above guaranteed value	p. 356
Universal relations and #P-completeness	p. 368
Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes	p. 380
Table of Contents provided by Blackwell. All Rights Reserved.

Algorithms and Complexity

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

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Graphics Programming

Developing Graphics Frameworks with Java and OpenGL

Curves and Surfaces for CAGD

A Practical Guide

The Book of WebGPU

R Graphics Cookbook

Practical Recipes for Visualizing Data

Collecting, Processing and Presenting Geoscientific Information with Python

Springer Textbooks in Earth Sciences, Geography and Environment

Making Images with Mathematics

From Small Formulas to Digital and Virtual Creativity

UML 2.0 in a Nutshell

A Desktop Quick Reference

Learning UML 2.0

A Pragmatic Introduction to UML

Mastering Perl/TK

Graphical User Interfaces in Perl

Mastering Graphics Programming with Vulkan

Develop a modern rendering engine from first principles to state-of-the-art techniques

A Guide to Adobe Animate

Creating Your First Animations

Art Between Matter and Code

Bridging Classical Art and Digital Frontiers

Hlsl and Pixel Shaders for XAML Developers

A Comprehensive Guide to Creating Hlsl Pixel Shaders for Wpf and Silverlight Applications

Learning Virtual Reality

Developing Immersive Experiences and Applications for Desktop, Web, and Mobile

Spatial Humanities

The Spatial Humanities

From Pixels to Perception

The Interplay Between Real and Virtual Human Experiences

Parametric and Generative Design with Rhino Python and Grasshopper

Exploration in Form Finding and Procedural Generation

Combinatorial Optimization and Applications

18th International Conference, COCOA 2025, Tianjin, China, November 28-30, 2025, Proceedings

Computer Graphics with OpenGL

Cuda by Example

An Introduction to General-Purpose Gpu Programming

The Designer's Guide to Product Vision

Learn to Build Your Strategic Influence to Shape the Future

Storyboarding

Turning Script to Motion, 2nd Edition

Make Amazing Games

Using Fusion 2.5

Rules of Play

Game Design Fundamentals

This product is categorised by