Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization and Applications

9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Zaixin Lu

    1. Dept. of Mathematics and Computer Science, Marywood University, Scranton, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Donghyun Kim

    1. North Carolina Central University, Durham, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Weili Wu

    1. University of Texas at Dallas, Richardson, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Wei Li

    1. Texas Southern University, Houston, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Ding-Zhu Du

    1. University of Texas at Dallas, Richardson, 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 9486)

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

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

  2. Classic Combinatorial Optimization

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Improved Algorithms for the Evacuation Route Planning Problem

      • Gopinath Mishra, Subhra Mazumdar, Arindam Pal
      Pages 3-19

    3. Improved MaxSAT Algorithms for Instances of Degree 3

      • Chao Xu, Jianer Chen, Jianxin Wang
      Pages 20-30

    4. Directed Pathwidth and Palletizers

      • Frank Gurski, Jochen Rethmann, Egon Wanke
      Pages 31-44

    5. Black and White Bin Packing Revisited

      • Jing Chen, Xin Han, Wolfgang Bein, Hing-Fung Ting
      Pages 45-59

    6. Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties

      • Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu
      Pages 60-71

    7. A \((5.83+\epsilon )\)-Approximation Algorithm for Universal Facility Location Problem with Linear Penalties

      • Yicheng Xu, Dachuan Xu, Donglei Du, Chenchen Wu
      Pages 72-81

    8. Variants of Multi-resource Scheduling Problems with Equal Processing Times

      • Hamed Fahimi, Claude-Guy Quimper
      Pages 82-97

  3. Geometric Optimization

    1. Front Matter

      Pages 99-99
      Download chapter PDF

    2. The Discrete and Mixed Minimax 2-Center Problem

      • Yi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu
      Pages 101-109

    3. Approximation Algorithms for Generalized MST and TSP in Grid Clusters

      • Binay Bhattacharya, Ante Ćustić, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol
      Pages 110-125

    4. Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line

      • Apurva Mudgal, Supantha Pandit
      Pages 126-137

    5. Optimal Self-assembly of Finite Shapes at Temperature 1 in 3D

      • David Furcy, Scott M. Summers
      Pages 138-151

    6. Line Segment Covering of Cells in Arrangements

      • Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen
      Pages 152-162

    7. An Improved On-line Strategy for Exploring Unknown Polygons

      • Xuehou Tan, Qi Wei
      Pages 163-177

    8. Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem

      • Michael Khachay, Helen Zaytseva
      Pages 178-190

  4. Network Optimization

    1. Front Matter

      Pages 191-191
      Download chapter PDF

    2. A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks

      • Gennaro Cordasco, Luisa Gargano, Marco Mecchia, Adele A. Rescigno, Ugo Vaccaro
      Pages 193-208

    3. An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar

      • Alejandro Erickson, Abbas Eslami Kiasari, Javier Navaridas, Iain A. Stewart
      Pages 209-220
Back to top

Keywords

About this book

This book constitutes the refereed proceedings of the 9th International Conference on Combinatorial Optimization and Applications, COCOA 2015, held in Houston, TX, USA, in December 2015. The 59 full papers included in the book were carefully reviewed and selected from 125 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; applied optimization; complexity and game; and optimization in graphs.

Editors and Affiliations

  • Dept. of Mathematics and Computer Science, Marywood University, Scranton, USA

    Zaixin Lu

  • North Carolina Central University, Durham, USA

    Donghyun Kim

  • University of Texas at Dallas, Richardson, USA

    Weili Wu, Ding-Zhu Du

  • Texas Southern University, Houston, USA

    Wei Li

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation