000 04836nam a22005775i 4500
001 978-3-642-17458-2
003 DE-He213
005 20140220084551.0
007 cr nn 008mamaa
008 101215s2010 gw | s |||| 0|eng d
020 _a9783642174582
_9978-3-642-17458-2
024 7 _a10.1007/978-3-642-17458-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aWu, Weili.
_eeditor.
245 1 0 _aCombinatorial Optimization and Applications
_h[electronic resource] :
_b4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I /
_cedited by Weili Wu, Ovidiu Daescu.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXVI, 424p. 105 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 ;
_v6508
505 0 _aTermination of Multipartite Graph Series Arising from Complex Network Modelling -- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids -- Evacuation of Rectilinear Polygons -- A Fast Algorithm for Powerful Alliances in Trees -- NP-Completeness of Spreading Colored Points -- Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach -- Feasibility-Based Bounds Tightening via Fixed Points -- A Characterisation of Stable Sets in Games with Transitive Preference -- Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering -- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations -- Bases of Primitive Nonpowerful Sign Patterns -- Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures -- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets -- Finding Strong Bridges and Strong Articulation Points in Linear Time -- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks -- An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs -- On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs -- Cyclic Vertex Connectivity of Star Graphs -- The Number of Shortest Paths in the (n, k)-Star Graphs -- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems -- PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks -- A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP -- Computing Toolpaths for 5-Axis NC Machines -- A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs -- A Randomized Algorithm for Weighted Approximation of Points by a Step Function -- Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials -- The Union of Colorful Simplices Spanned by a Colored Point Set -- Compact Visibility Representation of 4-Connected Plane Graphs -- Some Variations on Constrained Minimum Enclosing Circle Problem -- Searching for an Axis-Parallel Shoreline -- Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs -- Scheduling Packets with Values and Deadlines in Size-Bounded Buffers -- Transporting Jobs through a Processing Center with Two Parallel Machines.
520 _aThis book constitutes the refereed proceedings of the 4th International Conference on Combinatorial Optimization and Applications, COCOA 2010, held in Kailua-Kona, HI, USA, in December 2010. The 49 revised full papers were carefully reviewed and selected from 108 submissions.
650 0 _aComputer science.
650 0 _aComputer Communication Networks.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aAlgebra
_xData processing.
650 0 _aComputer graphics.
650 0 _aBioinformatics.
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 _aComputer Graphics.
650 2 4 _aComputational Biology/Bioinformatics.
650 2 4 _aSymbolic and Algebraic Manipulation.
700 1 _aDaescu, Ovidiu.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642174575
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6508
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-17458-2
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112914
_d112914