Combinatorial Optimization and Applications

1. Front Matter

   Pages I-XV

   PDF

2. Classic Combinatorial Optimization

   1. Front Matter

      Pages 1-1

      PDF

   2. An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling

      • Sean Yaw, Brendan Mumey

      Pages 3-12

   3. An Asymptotic Competitive Scheme for Online Bin Packing

      • Lin Chen, Deshi Ye, Guochuan Zhang

      Pages 13-24

   4. Randomized Online Algorithms for Set Cover Leasing Problems

      • Sebastian Abshoff, Christine Markarian, Friedhelm Meyer auf der Heide

      Pages 25-34

3. Geometric Optimization

   1. Front Matter

      Pages 35-35

      PDF

   2. Optimizing Squares Covering a Set of Points

      • Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song

      Pages 37-52

   3. Algorithms for Fair Partitioning of Convex Polygons

      • Bogdan Armaselu, Ovidiu Daescu

      Pages 53-65

   4. A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW

      • Liang Song, Hejiao Huang, Hongwei Du

      Pages 66-73

   5. On-Line Strategies for Evacuating from a Convex Region in the Plane

      • Qi Wei, Xuehou Tan, Bo Jiang, Lijuan Wang

      Pages 74-85

   6. Rectilinear Duals Using Monotone Staircase Polygons

      • Yi-Jun Chang, Hsu-Chun Yen

      Pages 86-100

   7. Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot

      • Azadeh Tabatabaei, Mohammad Ghodsi

      Pages 101-112

   8. Guarding Monotone Art Galleries with Sliding Cameras in Linear Time

      • Mark de Berg, Stephane Durocher, Saeed Mehrabi

      Pages 113-125

4. Network Optimization

   1. Front Matter

      Pages 127-127

      PDF

   2. Information Gathering in Ad-Hoc Radio Networks with Tree Topology

      • Marek Chrobak, Kevin Costello, Leszek Gasieniec, Darek R. Kowalski

      Pages 129-145

   3. Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network

      • Binay Bhattacharya, Tsunehiko Kameda

      Pages 146-160

   4. Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks

      • Zaobo He, Zhipeng Cai, Siyao Cheng, Xiaoming Wang

      Pages 161-172

   5. Interference-Free k-barrier Coverage in Wireless Sensor Networks

      • Hongwei Du, Haiming Luo, Jing Zhang, Rongrong Zhu, Qiang Ye

      Pages 173-183

   6. Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Space

      • Jun Li, Xiaofeng Gao, Guihai Chen, Fengwei Gao, Ling Ding

      Pages 184-199

   7. A Practical Greedy Approximation for the Directed Steiner Tree Problem

      • Dimitri Watel, Marc-Antoine Weisser

      Pages 200-215

This book constitutes the refereed proceedings of the 8th International Conference on Combinatorial Optimization and Applications, COCOA 2014, held on the island of Maui, Hawaii, USA, in December 2014. The 56 full papers included in the book were carefully reviewed and selected from 133 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; optimization in graphs; applied optimization; CSoNet; and complexity, cryptography, and games.

• Approximation algorithms
• Approximation solution
• Bin-packing
• Complex network
• Computational complexity
• Covering
• Dynamic programming
• Exact solution
• Game
• Integer programming
• Parallel processing
• Partition
• Pathwidth network
• Radio network
• Scheduling
• Social network
• Steiner tree
• algorithm analysis and problem complexity

• Zhejiang Normal University, Jinhua, China

  Zhao Zhang

• University of Texas, Tyler, USA

  Lidong Wu

• University of Texas, Dallas, USA

  Wen Xu, Ding-Zhu Du

Policies and ethics