000 04671nam a22005535i 4500
003 DE-He213
005 20191012064951.0
007 cr nn 008mamaa
008 101221s2006 gw | s |||| 0|eng d
020 6 4 _a9783540343783
_9978-3-540-34378-3
024 8 7 _a10.1007/11758471
_2doi
050 8 4 _aLibro electrónico
072 8 7 _aUMB
_2bicssc
072 8 7 _aCOM051300
_2bisacsh
082 _a005.1
_223
100 8 1 _aCalamoneri, Tiziana.
_eeditor.
_9116180
245 9 7 _aAlgorithms and Complexity
_h[electronic resource] :
_b6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006. Proceedings /
_cedited by Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano.
001 000068117
300 6 4 _aXII, 396 p.
_bonline resource.
490 8 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3998
505 8 0 _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.
650 8 0 _aComputer science.
_9116181
650 8 0 _aData structures (Computer science).
_96719
650 8 0 _aComputer software.
_910118
650 8 0 _aComputational complexity.
_98597
650 8 0 _aComputer graphics.
_9116182
650 _aComputer Science.
_9116183
650 _aAlgorithm Analysis and Problem Complexity.
_910120
650 _aData Structures.
_9116184
650 _aComputation by Abstract Devices.
_99725
650 _aDiscrete Mathematics in Computer Science.
_98602
650 _aComputer Graphics.
_9116185
700 8 1 _aFinocchi, Irene.
_eeditor.
_9116186
700 8 1 _aItaliano, Giuseppe F.
_eeditor.
_9116187
710 8 2 _aSpringerLink (Online service)
_9116188
773 8 0 _tSpringer eBooks
776 _iPrinted edition:
_z9783540343752
830 8 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3998
_9116189
856 _uhttp://dx.doi.org/10.1007/11758471
_zde clik aquí para ver el libro electrónico
264 8 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
336 6 4 _atext
_btxt
_2rdacontent
337 6 4 _acomputer
_bc
_2rdamedia
338 6 4 _aonline resource
_bcr
_2rdacarrier
347 6 4 _atext file
_bPDF
_2rda
516 6 4 _aZDB-2-SCS
516 6 4 _aZDB-2-LNC
999 _c61380
_d61380
942 _c05