Combinatorial Optimization and Applications [electronic resource] : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II / edited by Weili Wu, Ovidiu Daescu.
By: Wu, Weili [editor.].
Contributor(s): Daescu, Ovidiu [editor.] | SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 6509Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: XVI, 416p. 80 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642174612.Subject(s): Computer science | Computer Communication Networks | Computer software | Computational complexity | Algebra -- Data processing | Computer graphics | Bioinformatics | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Computer Communication Networks | Computer Graphics | Computational Biology/Bioinformatics | Symbolic and Algebraic ManipulationDDC classification: 005.1 Online resources: Click here to access online Coverage 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.
This 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.
There are no comments for this item.