| 000 | 04582nam a22006255i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-13073-1 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125811.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100510s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642130731 _9978-3-642-13073-1 |
||
| 024 | 7 |
_a10.1007/978-3-642-13073-1 _2doi |
|
| 050 | 4 | _aQA76.6-76.66 | |
| 072 | 7 |
_aUM _2bicssc |
|
| 072 | 7 |
_aCOM051000 _2bisacsh |
|
| 072 | 7 |
_aUM _2thema |
|
| 082 | 0 | 4 |
_a005.11 _223 |
| 245 | 1 | 0 |
_aAlgorithms and Complexity _h[electronic resource] : _b7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings / _cedited by Josep Diaz, Tiziana Calamoneri. |
| 250 | _a1st ed. 2010. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
| 300 |
_aXI, 384 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 ; _v6078 |
|
| 505 | 0 | _aInvited Talks -- Towards a Distributed Search Engine -- Mechanisms for the Marriage and the Assignment Game -- Resilient Algorithms and Data Structures -- Session 1. Graph Algorithms I -- An Exact Algorithm for Connected Red-Blue Dominating Set -- Maximizing PageRank with New Backlinks -- Enumerating Rooted Graphs with Reflectional Block Structures -- Improved Approximations for TSP with Simple Precedence Constraints -- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number -- Session 2. Computational Complexity -- Parameterized Complexity of Even/Odd Subgraph Problems -- Popular Matchings in the Marriage and Roommates Problems -- Bounding the Number of Tolerable Faults in Majority-Based Systems -- A Parameterized Algorithm for Chordal Sandwich -- Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown -- Session 3. Graph Coloring -- Graph Unique-Maximum and Conflict-Free Colorings -- Strategic Coloring of a Graph -- Session 4. Tree Algorithms and Tree Decompositions -- Multicut Algorithms via Tree Decompositions -- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality -- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights -- A Planar Linear Arboricity Conjecture -- Session 5. Computational Geometry -- On the Number of Higher Order Delaunay Triangulations -- How Simple Robots Benefit from Looking Back -- Session 6. Game Theory -- On Strategy Improvement Algorithms for Simple Stochastic Games -- Online Cooperative Cost Sharing -- Session 7. Graph Algorithms II -- On the Power of Nodes of Degree Four in the Local Max-Cut Problem -- Packing Bipartite Graphs with Covers of Complete Bipartite Graphs -- Irredundant Set Faster Than O(2 n ) -- The Complexity of Computing Minimal Unidirectional Covering Sets -- A ParameterizedRoute to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance -- Session 8. String Algorithms -- Finding the Maximum Suffix with Fewer Comparisons -- An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences -- Session 9. Network Algorithms -- Capacitated Confluent Flows: Complexity and Algorithms -- Preprocessing Speed-Up Techniques Is Hard -- Communication Requirements for Stable Marriages. | |
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aComputer networks . | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 |
_aArtificial intelligence _xData processing. |
|
| 650 | 1 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aData Science. |
| 700 | 1 |
_aDiaz, Josep. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aCalamoneri, Tiziana. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642130724 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642130748 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6078 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13073-1 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c181848 _d181848 |
||