Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization and Applications

10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016, Proceedings

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. T-H. Hubert Chan

    1. University of Hong Kong, Hong Kong, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Minming Li

    1. City University of Hong Kong, Hong Kong, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Lusheng Wang

    1. City University of Hong Kong, Hong Kong, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10043)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: COCOA 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (60 papers)

  1. Front Matter

    Pages I-XV
    Download chapter PDF

  2. Graph Theory

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. On the Capture Time of Cops and Robbers Game on a Planar Graph

      • Photchchara Pisantechakool, Xuehou Tan
      Pages 3-17

    3. The Mixed Evacuation Problem

      • Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
      Pages 18-32

    4. A Comprehensive Reachability Evaluation for Airline Networks with Multi-constraints

      • Xiaotian You, Xiaofeng Gao, Yaru Dang, Guihai Chen, Xinglong Wang
      Pages 33-48

    5. Approximation and Hardness Results for the Max k-Uncut Problem

      • Peng Zhang, Chenchen Wu, Dachuan Xu, Xinghe Zhang
      Pages 49-61

    6. On Strong Tree-Breadth

      • Arne Leitert, Feodor F. Dragan
      Pages 62-76

    7. Computing a Tree Having a Small Vertex Cover

      • Takuro Fukunaga, Takanori Maehara
      Pages 77-91

    8. On the Approximability of Partial VC Dimension

      • Cristina Bazgan, Florent Foucaud, Florian Sikora
      Pages 92-106

    9. Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Graphs

      • Tai-Ling Ye, Dun-Wei Cheng, Sun-Yuan Hsieh
      Pages 107-112

    10. Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis

      • Riccardo Dondi, Florian Sikora
      Pages 113-127

    11. Total Dual Integrality of Triangle Covering

      • Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang
      Pages 128-143

    12. Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model

      • Petr Gregor, Riste Škrekovski, Vida Vukašinović
      Pages 144-158

    13. Fast Searching on Complete k-partite Graphs

      • Yuan Xue, Boting Yang, Farong Zhong, Sandra Zilles
      Pages 159-174

    14. Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks

      • Ulrik Brandes, Eugenia Holm, Andreas Karrenbauer
      Pages 175-186

    15. Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem

      • Pawan Aurora, Monalisa Jena, Rajiv Raman
      Pages 187-201

    16. An Introduction to Coding Sequences of Graphs

      • Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen
      Pages 202-215

    17. Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem

      • Étienne Birmelé, Fabien de Montgolfier, Léo Planche
      Pages 216-229

    18. On the Complexity of Extracting Subtree with Keeping Distinguishability

      • Xianmin Liu, Zhipeng Cai, Dongjing Miao, Jianzhong Li
      Pages 230-240

    19. Safe Sets in Graphs: Graph Classes and Structural Parameters

      • Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui et al.
      Pages 241-253
Back to top

Other volumes

  1. Combinatorial Optimization and Applications

Keywords

About this book

This book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016.

The 60 full papers included in the book were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous.

Editors and Affiliations

  • University of Hong Kong, Hong Kong, China

    T-H. Hubert Chan

  • City University of Hong Kong, Hong Kong, China

    Minming Li, Lusheng Wang

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation