LEADER 06303nam 22007935 450 001 9910484686303321 005 20230406061525.0 010 $a1-280-39058-1 010 $a9786613568502 010 $a3-642-17461-2 024 7 $a10.1007/978-3-642-17461-2 035 $a(CKB)2670000000064707 035 $a(SSID)ssj0000475973 035 $a(PQKBManifestationID)11291329 035 $a(PQKBTitleCode)TC0000475973 035 $a(PQKBWorkID)10479268 035 $a(PQKB)10630842 035 $a(DE-He213)978-3-642-17461-2 035 $a(MiAaPQ)EBC3066258 035 $a(PPN)149893426 035 $a(EXLCZ)992670000000064707 100 $a20101215d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Optimization and Applications $e4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II /$fedited by Weili Wu, Ovidiu Daescu 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XVI, 416 p. 80 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6509 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-17460-4 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6509 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aComputer graphics 606 $aBioinformatics 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aComputer Graphics 606 $aComputational and Systems Biology 606 $aSymbolic and Algebraic Manipulation 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aComputer graphics. 615 0$aBioinformatics. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 615 24$aComputational and Systems Biology. 615 24$aSymbolic and Algebraic Manipulation. 676 $a005.1 702 $aWu$b Weili$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDaescu$b Ovidiu$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910484686303321 996 $aCombinatorial Optimization and Applications$9772251 997 $aUNINA