LEADER 05272nam 22007575 450 001 996465902403316 005 20230406054313.0 010 $a3-540-34378-4 024 7 $a10.1007/11758471 035 $a(CKB)1000000000232983 035 $a(SSID)ssj0000316176 035 $a(PQKBManifestationID)11238997 035 $a(PQKBTitleCode)TC0000316176 035 $a(PQKBWorkID)10274783 035 $a(PQKB)10442046 035 $a(DE-He213)978-3-540-34378-3 035 $a(MiAaPQ)EBC3068070 035 $a(PPN)123135028 035 $a(EXLCZ)991000000000232983 100 $a20101221d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Complexity$b[electronic resource] $e6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings /$fedited by Tiziana Calamoneri, Irene Finocchi, Guiseppe F. Italiano 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XII, 396 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3998 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-34375-X 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3998 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer science 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aAlgorithms 606 $aData Science 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 14$aAlgorithms. 615 24$aData Science. 615 24$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a511.8 702 $aCalamoneri$b Tiziana$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFinocchi$b Irene$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aItaliano$b Guiseppe F$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aItalian Conference on Algorithms and Complexity 906 $aBOOK 912 $a996465902403316 996 $aAlgorithms and complexity$955800 997 $aUNISA