Algorithms and complexity [electronic resource] : 6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006 : proceedings / Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (eds.).
- Conference Author:
- Italian Conference on Algorithms and Complexity (6th : 2006 : Rome, Italy)
- Additional Titles:
- CIAC 2006
- Published:
- Berlin ; New York : Springer, [2006]
- Copyright Date:
- ©2006
- Physical Description:
- xii, 394 pages : illustrations ; 24 cm.
- Additional Creators:
- Calamoneri, Tiziana
Finocchi, Irene
Italiano, Giuseppe F. - Access Online:
- serialssolutions.com
- Series:
- Lecture notes in computer science, 0302-9743 ; 3998
- Restrictions on Access:
- License restrictions may limit access.
- Contents:
- Machine generated contents note: Reliable and efficient geometric computing / Kurt Mehlhorn -- Beware of the model : reflections on algorithmic research / Franco P. Preparata -- On search problems in complexity theory and in logic (abstract) / P. Pudlak -- Covering a set of points with a minimum number of lines / Magdalene Grantson / Christos Levcopoulos -- Approximation algorithms for capacitated rectangle stabbing / Guy Even / Dror Rawitz / Shimon (Moni) Shahar -- In-place randomized slope selection / Henrik Blunck / Jan Vahrenhold -- Quadratic programming and combinatorial minimum weight product problems / Walter Kern / Gerhard Woeginger -- Counting all solutions of minimum weight exact satisfiability / Stefan Porschen -- Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms / Evgeny Dantsin / Edward A. Hirsch / Alexander Wolpert -- Network discovery and verification with distance queries / Thomas Erlebach / Alexander Hall / Michael Hoffmann / Matus Mihalak -- Deciding the FIFO stability of networks in polynomial time / Maik Weinard -- Heterogenous networks can be unstable at arbitrarily low injection rates / Dimitrios Koukopoulos / Stavros D. Nikolopoulos -- Provisioning a virtual private network under the presence of non-communicating groups / Friedrich Eisenbrand / Edda Happ -- Gathering algorithms on paths under interference constraints / Jean-Claude Bermond / Ricardo Correa / Minli Yu -- On the hardness of range assignment problems / Bernhard Fuchs -- Black hole search in asynchronous rings using tokens / S. Dobrev / R. Kralovic / N. Santoro / W. Shi -- On broadcast scheduling with limited energy / Christian Gunia -- A near optimal scheduler for on-demand data broadcasts / Hing-Fung Ting -- Fair cost-sharing methods for scheduling jobs on parallel machines / Yvonne Bleischwitz / Burkhard Monien -- Tighter approximation bounds for LPT scheduling in two special cases / Annamaria Kovacs -- Inapproximability results for orthogonal rectangle packing problems with rotations / Miroslav Chlebik / Janka Chlebikova -- Approximate hierarchical facility location and applications to the shallow Steiner tree and range assignment problems / Erez Kantor / David Peleg -- An approximation algorithm for a bottleneck traveling salesman problem / Ming-Yang Kao / Manan Sanghi -- On the minimum common integer partition problem / Xin Chen / Lan Liu / Zheng Liu / Tao Jiang -- Matching subsequences in trees / Philip Bille / Inge Li Gortz -- Distance approximating trees : complexity and algorithms / Feodor F. Dragan / Chenyu Yan -- How to pack directed acyclic graphs into small blocks / Yuichi Asahiro / Tetsuya Furukawa / Keiichi Ikegami / Eiji Miyano -- On-line coloring of J-free bipartite graphs / H. J. Broersma / A. Capponi / D. Paulusma -- Distributed approximation algorithms for planar graphs / Andrzej Czygrinow / Michal Hanckowiak / Edyta Szymanska -- A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small / Raghav Kulkarni -- Fixed-parameter tractability results for feedback set problems in tournaments / Michael Dom / Jiong Guo / Falk Huffner / Rolf Niedermeier / Anke Truss -- Parameterized algorithms for hitting set : the weighted case / Henning Fernau -- Fixed-parameter tractable generalizations of cluster editing / Peter Damaschke -- The linear arrangement problem parameterized above guaranteed value / Gregory Gutin / Arash Rafiey / Stefan Szeider / Anders Yeo -- Universal relations and #P-completeness / Herve Fournier / Guillaume Malod.
- Subject(s):
- Genre(s):
- ISBN:
- 354034375X (pbk.)
9783540343752 (pbk.)
9783540343752 - Bibliography Note:
- Includes bibliographical references and index.
View MARC record | catkey: 7785877