000 04601nam a22005775i 4500
001 978-3-642-17461-2
003 DE-He213
005 20140220084551.0
007 cr nn 008mamaa
008 101215s2010 gw | s |||| 0|eng d
020 _a9783642174612
_9978-3-642-17461-2
024 7 _a10.1007/978-3-642-17461-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 II /
_cedited by Weili Wu, Ovidiu Daescu.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXVI, 416p. 80 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 ;
_v6509
505 0 _aCoverage with k-Transmitters in the Presence of Obstacles -- On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem -- Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations -- Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks -- Time Optimal Algorithms for Black Hole Search in Rings -- Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle -- A Constant-Factor Approximation Algorithm for the Link Building Problem -- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme -- Computational Study for Planar Connected Dominating Set Problem -- Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives -- A Search-Based Approach to the Railway Rolling Stock Allocation Problem -- Approximation Algorithm for the Minimum Directed Tree Cover -- An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs -- A New Result on [k,k?+?1]-Factors Containing Given Hamiltonian Cycles -- Yao Graphs Span Theta Graphs -- A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time -- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs -- A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem -- Fast Edge-Searching and Related Problems -- Diameter-Constrained Steiner Tree -- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks -- A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree -- Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks -- Structured Overlay Network for File Distribution -- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations -- The Networked Common Goods Game -- A Novel Branching Strategy for Parameterized Graph Modification Problems -- Listing Triconnected Rooted Plane Graphs -- Bipartite Permutation Graphs Are Reconstructible -- A Transformation from PPTL to S1S -- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs -- Approximate Ellipsoid in the Streaming Model.
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:
_z9783642174605
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6509
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-17461-2
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112915
_d112915