Skip to main content
SpringerLink
Log in
Book cover

Computing and Combinatorics

21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Dachuan Xu

    1. Beijing University of Technology, Beijing, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Donglei Du

    1. University of New Brunswick, Fredericton, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Dingzhu Du

    1. University of Texas at Dallas, Richardson, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report

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

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

Included in the following conference series:

Conference proceedings info: COCOON 2015.

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 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-XVI
    Download chapter PDF

  2. Graph Algorithms I

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Mining Preserving Structures in a Graph Sequence

      • Takeaki Uno, Yushi Uno
      Pages 3-15

    3. On the Most Imbalanced Orientation of a Graph

      • Walid Ben-Ameur, Antoine Glorieux, José Neto
      Pages 16-29

    4. Cheeger Inequalities for General Edge-Weighted Directed Graphs

      • T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang
      Pages 30-41

  3. Game Theory and Algorithms

    1. Front Matter

      Pages 43-43
      Download chapter PDF

    2. Strategy-Proof Mechanism for Obnoxious Facility Location on a Line

      • Deshi Ye, Lili Mei, Yong Zhang
      Pages 45-56

    3. Bin Packing Game with an Interest Matrix

      • Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
      Pages 57-69

    4. The Least-Core and Nucleolus of Path Cooperative Games

      • Qizhi Fang, Bo Li, Xiaohan Shan, Xiaoming Sun
      Pages 70-82

    5. Reversible Pebble Game on Trees

      • Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani
      Pages 83-94

  4. Computational Complexity

    1. Front Matter

      Pages 95-95
      Download chapter PDF

    2. Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms

      • Kameng Nip, Zhenbo Wang, Wenxun Xing
      Pages 97-108

    3. Complexity of Grundy Coloring and Its Variants

      • Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
      Pages 109-120

    4. On the Complexity of the Minimum Independent Set Partition Problem

      • T.-H. Hubert Chan, Charalampos Papamanthou, Zhichao Zhao
      Pages 121-132

    5. Bivariate Complexity Analysis of Almost Forest Deletion

      • Ashutosh Rai, Saket Saurabh
      Pages 133-144

  5. Approximation Algorithms

    1. Front Matter

      Pages 145-145
      Download chapter PDF

    2. Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems

      • Wei Yu, Zhaohui Liu
      Pages 147-158

    3. Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems

      • Peng Zhang, Tao Jiang, Angsheng Li
      Pages 159-170

    4. An Approximation Algorithm for the Smallest Color-Spanning Circle Problem

      • Yin Wang, Yinfeng Xu
      Pages 171-182

    5. Approximation Algorithms for the Connected Sensor Cover Problem

      • Lingxiao Huang, Jian Li, Qicai Shi
      Pages 183-196
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

About this book

This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. The 49 revised full papers and 11 shorter papers presented were carefully reviewed and selected from various submissions. The papers cover various topics including algorithms and data structures; algorithmic game theory; approximation algorithms and online algorithms; automata, languages, logic and computability; complexity theory; computational learning theory; cryptography, reliability and security; database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization; graph theory, communication networks, optimization and parallel and distributed computing.

Editors and Affiliations

  • Beijing University of Technology, Beijing, China

    Dachuan Xu

  • University of New Brunswick, Fredericton, Canada

    Donglei Du

  • University of Texas at Dallas, Richardson, USA

    Dingzhu Du

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation