| 000 | 04874nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-34378-3 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125947.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 101221s2006 gw | s |||| 0|eng d | ||
| 020 |
_a9783540343783 _9978-3-540-34378-3 |
||
| 024 | 7 |
_a10.1007/11758471 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a518.1 _223 |
| 245 | 1 | 0 |
_aAlgorithms and Complexity _h[electronic resource] : _b6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings / _cedited by Tiziana Calamoneri, Irene Finocchi, Guiseppe F. Italiano. |
| 250 | _a1st ed. 2006. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
| 300 |
_aXII, 396 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3998 |
|
| 505 | 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 PackDirected 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 | 0 | _aAlgorithms. | |
| 650 | 0 |
_aArtificial intelligence _xData processing. |
|
| 650 | 0 | _aComputer science. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 1 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aData Science. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 700 | 1 |
_aCalamoneri, Tiziana. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aFinocchi, Irene. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aItaliano, Guiseppe F. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540343752 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540824237 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3998 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/11758471 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c183528 _d183528 |
||