000 04210nam a22005775i 4500
001 978-3-642-32241-9
003 DE-He213
005 20140220083324.0
007 cr nn 008mamaa
008 120813s2012 gw | s |||| 0|eng d
020 _a9783642322419
_9978-3-642-32241-9
024 7 _a10.1007/978-3-642-32241-9
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aGudmundsson, Joachim.
_eeditor.
245 1 0 _aComputing and Combinatorics
_h[electronic resource] :
_b18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings /
_cedited by Joachim Gudmundsson, Julián Mestre, Taso Viglas.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aXIV, 606 p. 116 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7434
505 0 _aA Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems -- Speed Scaling for Maximum Lateness -- Induced Subgraph Isomorphism: Are Some Patterns Substantially -- Easier Than Others -- Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs -- Online Knapsack Problem with Removal Cost -- An Improved Exact Algorithm for TSP in Degree-4 Graphs -- Dynamic Programming for H-minor-free Graphs -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks -- Towards Optimal and Expressive Kernelization for d-Hitting Set.-Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property -- Rainbow Colouring of Split and Threshold -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Succinct Representations of Binary Trees for Range Minimum Queries.
520 _aThis book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics  covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aArtificial intelligence.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Communication Networks.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aComputer Graphics.
650 2 4 _aArtificial Intelligence (incl. Robotics).
700 1 _aMestre, Julián.
_eeditor.
700 1 _aViglas, Taso.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642322402
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7434
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-32241-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c103466
_d103466