Coverart for item
The Resource Algorithms and complexity : 6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006 : proceedings, Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (eds.), (electronic book)

Algorithms and complexity : 6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006 : proceedings, Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (eds.), (electronic book)

Label
Algorithms and complexity : 6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006 : proceedings
Title
Algorithms and complexity
Title remainder
6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006 : proceedings
Statement of responsibility
Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (eds.)
Title variation
CIAC 2006
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
511.8
Illustrations
illustrations
Index
index present
LC call number
QA9.58
LC item number
.I885 2006eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2006
http://bibfra.me/vocab/lite/meetingName
Italian Conference on Algorithms and Complexity
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Calamoneri, Tiziana
  • Finocchi, Irene
  • Italiano, Giuseppe F
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
3998
http://library.link/vocab/subjectName
  • Algorithms
  • Computational complexity
Label
Algorithms and complexity : 6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006 : proceedings, Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (eds.), (electronic book)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource (xii, 394 pages)
Form of item
online
Isbn
9783540343752
Lccn
2006925893
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/11758471
Other physical details
illustrations.
Specific material designation
remote
System control number
  • SPR262692781
  • ocn262692781
Label
Algorithms and complexity : 6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006 : proceedings, Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (eds.), (electronic book)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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
Dimensions
unknown
Extent
1 online resource (xii, 394 pages)
Form of item
online
Isbn
9783540343752
Lccn
2006925893
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/11758471
Other physical details
illustrations.
Specific material designation
remote
System control number
  • SPR262692781
  • ocn262692781

Library Locations

Processing Feedback ...