000 05961nam a22006255i 4500
001 978-3-642-17461-2
003 DE-He213
005 20240730201108.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
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
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.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXVI, 416 p. 80 illus.
_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 ;
_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 inPacket 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 _aThe 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18-20, 2010. Past COCOA conferences were held in Xi'an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Mexico, New Zealand, Poland, Slovak Republic, Spain, Sweden, Switzerland, Taiwan, UK, USA, Vietnam, etc. Among the 108 submissions, 49 regular papers were selected for presentation at the conference and are included in this volume. Some of these papers will be selected for publication in a special issue of the Journal of Combinatorial Optimization, a special issue of Theoretical Computer Science, a special issue of Optimization Letters, and a special issue of Discrete Mathematics, Algorithms and Applications under the standard refereeing procedure.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aComputer networks .
_931572
650 0 _aComputer graphics.
_94088
650 0 _aBioinformatics.
_99561
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aComputer Communication Networks.
_9166001
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aComputational and Systems Biology.
_931619
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _aWu, Weili.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9166002
700 1 _aDaescu, Ovidiu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9166003
710 2 _aSpringerLink (Online service)
_9166004
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642174605
776 0 8 _iPrinted edition:
_z9783642174629
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6509
_9166005
856 4 0 _uhttps://doi.org/10.1007/978-3-642-17461-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c96371
_d96371