Book Volume 6509 2010

Combinatorial Optimization and Applications

4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II

Editors:

ISBN: 978-3-642-17460-5 (Print) 978-3-642-17461-2 (Online)

Table of contents (32 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Chapter

    Pages 1-15

    Coverage with k-Transmitters in the Presence of Obstacles

  3. No Access

    Chapter

    Pages 16-30

    On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem

  4. No Access

    Chapter

    Pages 31-45

    Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations

  5. No Access

    Chapter

    Pages 46-57

    Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks

  6. No Access

    Chapter

    Pages 58-71

    Time Optimal Algorithms for Black Hole Search in Rings

  7. No Access

    Chapter

    Pages 72-86

    Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle

  8. No Access

    Chapter

    Pages 87-96

    A Constant-Factor Approximation Algorithm for the Link Building Problem

  9. No Access

    Chapter

    Pages 97-106

    XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme

  10. No Access

    Chapter

    Pages 107-116

    Computational Study for Planar Connected Dominating Set Problem

  11. No Access

    Chapter

    Pages 117-130

    Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives

  12. No Access

    Chapter

    Pages 131-143

    A Search-Based Approach to the Railway Rolling Stock Allocation Problem

  13. No Access

    Chapter

    Pages 144-159

    Approximation Algorithm for the Minimum Directed Tree Cover

  14. No Access

    Chapter

    Pages 160-169

    An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs

  15. No Access

    Chapter

    Pages 170-180

    A New Result on [k,k + 1]-Factors Containing Given Hamiltonian Cycles

  16. No Access

    Chapter

    Pages 181-194

    Yao Graphs Span Theta Graphs

  17. No Access

    Chapter

    Pages 195-206

    A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time

  18. No Access

    Chapter

    Pages 207-218

    New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs

  19. No Access

    Chapter

    Pages 219-227

    A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem

  20. No Access

    Chapter

    Pages 228-242

    Fast Edge-Searching and Related Problems

  21. No Access

    Chapter

    Pages 243-253

    Diameter-Constrained Steiner Tree

previous Page of 2