Skip to main content
SpringerLink
Log in

Combinatorial Optimization and Applications

11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Xiaofeng Gao

    1. Shanghai Jiao Tong University, Shanghai, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hongwei Du

    1. Harbin Institute of Technology, Shenzhen, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Meng Han

    1. Kennesaw State University, Kennesaw, USA

    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 10628)

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

Included in the following conference series:

Conference proceedings info: COCOA 2017.

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 (39 papers)

  1. Front Matter

    Pages I-XVIII
    Download chapter PDF

  2. Combinatorial Optimization

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Algorithms for the Ring Star Problem

      • Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang, Ying Zhang
      Pages 3-16

    3. Price Fluctuation in Online Leasing

      • Björn Feldkord, Christine Markarian, Friedhelm Meyer Auf der Heide
      Pages 17-31

    4. Novel Scheduling for Energy Management in Microgrid

      • Zaixin Lu, Jd Youngs, Zhi Chen, Miao Pan
      Pages 32-44

    5. Improved Methods for Computing Distances Between Unordered Trees Using Integer Programming

      • Eunpyeong Hong, Yasuaki Kobayashi, Akihiro Yamamoto
      Pages 45-60

    6. Touring Convex Polygons in Polygonal Domain Fences

      • Arash Ahadi, Amirhossein Mozafari, Alireza Zarei
      Pages 61-75

    7. On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication Network

      • Zishen Yang, Donghyun Kim, Wei Wang
      Pages 76-93

    8. An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations

      • Wenjun Li, Chao Xu, Jianxin Wang, Yongjie Yang
      Pages 94-108

    9. Faster Algorithms for 1-Mappability of a Sequence

      • Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung
      Pages 109-121

    10. Lexico-Minimum Replica Placement in Multitrees

      • K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
      Pages 122-137

    11. Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable

      • Naomi Nishimura, Vijay Subramanya
      Pages 138-153

    12. A New Graph Parameter to Measure Linearity

      • Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
      Pages 154-168

    13. Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs

      • Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno
      Pages 169-181

    14. Toward Energy-Efficient and Robust Clustering Algorithm on Mobile Ad Hoc Sensor Networks

      • Huamei Qi, Tailong Xiao, Anfeng Liu, Su Jiang
      Pages 182-195

  3. Game Theory

    1. Front Matter

      Pages 197-197
      Download chapter PDF

    2. The Cop Number of the One-Cop-Moves Game on Planar Graphs

      • Ziyuan Gao, Boting Yang
      Pages 199-213

    3. The Price of Anarchy in Two-Stage Scheduling Games

      • Deshi Ye, Lin Chen, Guochuan Zhang
      Pages 214-225

    4. Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy

      • Cong Chen, Paolo Penna, Yinfeng Xu
      Pages 226-240

    5. An Improved Mechanism for Selfish Bin Packing

      • Xin Chen, Qingqin Nong, Qizhi Fang
      Pages 241-257
Back to top

Other volumes

  1. Combinatorial Optimization and Applications

  2. Combinatorial Optimization and Applications

Keywords

About this book

The two-volume set LNCS 10627 and 10628 constitutes the refereed proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017.

The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications.


Editors and Affiliations

  • Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  • Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  • Kennesaw State University, Kennesaw, USA

    Meng Han

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation