Skip to main content
SpringerLink
Log in

Combinatorial Optimization and Applications

13th International Conference, COCOA 2019, Xiamen, China, December 13–15, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Yingshu Li

    1. Georgia State University, Atlanta, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Mihaela Cardei

    1. Florida Atlantic University, Boca Raton, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Yan Huang

    1. Kennesaw State University, Marietta, 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 11949)

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

Included in the following conference series:

Conference proceedings info: COCOA 2019.

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

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem

    • Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
    Pages 1-12

  3. Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements

    • Mirza Galib Anwarul Husain Baig, Deepanjan Kesh
    Pages 13-25

  4. Critical Rows of Almost-Factorable Matrices

    • Peter Ballen
    Pages 26-38

  5. Minimum-Width Drawings of Phylogenetic Trees

    • Juan Jose Besa, Michael T. Goodrich, Timothy Johnson, Martha C. Osegueda
    Pages 39-55

  6. Balanced Connected Subgraph Problem in Geometric Intersection Graphs

    • Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
    Pages 56-68

  7. Approximating Bounded Job Start Scheduling with Application in Royal Mail Deliveries Under Uncertainty

    • Jeremy T. Bradley, Dimitrios Letsios, Ruth Misener, Natasha Page
    Pages 69-81

  8. Contact Representations of Directed Planar Graphs in 2D and 3D

    • Chun-Hsiang Chan, Hsu-Chun Yen
    Pages 82-93

  9. Identifying Structural Hole Spanners in Social Networks via Graph Embedding

    • Sijie Chen, Ziwei Quan, Yong Liu
    Pages 94-106

  10. The Price of Anarchy for the Load Balancing Game with a Randomizing Scheduler

    • Xujin Chen, Xiaodong Hu, Xiaoying Wu
    Pages 107-118

  11. A Randomized Approximation Algorithm for Metric Triangle Packing

    • Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang
    Pages 119-129

  12. Approximation Algorithms for Maximally Balanced Connected Graph Partition

    • Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang
    Pages 130-141

  13. Edge Exploration of a Graph by Mobile Agent

    • Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh
    Pages 142-154

  14. Fast Diameter Computation Within Split Graphs

    • Guillaume Ducoffe, Michel Habib, Laurent Viennot
    Pages 155-167

  15. Approximate Shortest Paths in Polygons with Violations

    • Binayak Dutta, Sasanka Roy
    Pages 168-180

  16. Parametrized Runtimes for Label Tournaments

    • Stefan Funke, Sabine Storandt
    Pages 181-196

  17. The k-Delivery Traveling Salesman Problem: Revisited

    • Jinxiang Gan, Guochuan Zhang
    Pages 197-209

  18. Algorithmic Pricing for the Partial Assignment

    • Guichen Gao, Li Ning, Hing-Fung Ting, Yong Zhang, Yifei Zou
    Pages 210-222

  19. Recognizing the Tractability in Big Data Computing

    • Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu
    Pages 223-234

  20. A Novel Virtual Traffic Light Algorithm Based on V2V for Single Intersection in Vehicular Networks

    • Longjiang Guo, De Wang, Peng Li, Lichen Zhang, Meirei Ren, Hong Liu et al.
    Pages 235-251
Back to top

Other volumes

  1. Combinatorial Optimization and Applications

Keywords

About this book

This volume constitutes the proceedings of the 13th International Conference on Combinatorial Optimization and Applications, COCOA 2019, held in Xiamen, China, in December 2019.
The 49 full papers presented in this volume were carefully reviewed and selected from 108 submissions. The papers cover the various topics, including cognitive radio networks, wireless sensor networks, cyber-physical systems, distributed and localized algorithm design and analysis, information and coding theory for wireless networks, localization, mobile cloud computing, topology control and coverage, security and privacy, underwater and underground networks, vehicular networks, information processing and data management, programmable service interfaces, energy-efficient algorithms, system and protocol design, operating system and middleware support, and experimental test-beds, models and case studies.

Editors and Affiliations

  • Georgia State University, Atlanta, USA

    Yingshu Li

  • Florida Atlantic University, Boca Raton, USA

    Mihaela Cardei

  • Kennesaw State University, Marietta, USA

    Yan Huang

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation