Combinatorial Optimization and Applications: 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings

✍ Scribed by Zhi-Zhong Chen, Ying Fan, Lusheng Wang (auth.), Peter Widmayer, Yinfeng Xu, Binhai Zhu (eds.)

• Publisher: Springer International Publishing
• Year: 2013
• Tongue: English
• Leaves: 446
• Series: Lecture Notes in Computer Science 8287 Theoretical Computer Science and General Issues
• Edition: 1
• Category: Library

✦ Synopsis

This book constitutes the refereed proceedings of the 7th International Conference on Combinatorial Optimization and Applications, COCOA 2013, held in Chengdu, China, in December 2013. The 36 full papers presented were carefully reviewed and selected from 72 submissions. The papers feature original research in the areas of combinatorial optimization and its applications. In addition to theoretical results there are reports on experimental and applied research of general algorithmic interest.

✦ Table of Contents

Front Matter....Pages -
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings....Pages 1-12
Discretely Following a Curve....Pages 13-24
NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation....Pages 25-36
A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem....Pages 37-48
Approximation Algorithms for the Maximum Multiple RNA Interaction Problem....Pages 49-59
On the Clustered Steiner Tree Problem....Pages 60-71
Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries....Pages 72-83
The Fractional Strong Metric Dimension of Graphs....Pages 84-95
Online Scheduling on Two Parallel Machines with Release Times and Delivery Times....Pages 96-105
Parallel Machine Scheduling with a Single Server: Loading and Unloading....Pages 106-116
Prompt Mechanism for Online Auctions with Multi-unit Demands....Pages 117-128
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm....Pages 129-140
A Nash Equilibrium Based Algorithm for Mining Hidden Links in Social Networks....Pages 141-152
An Improved Exact Algorithm for Undirected Feedback Vertex Set....Pages 153-164
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs....Pages 165-177
On Complexities of Minus Domination....Pages 178-189
A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree....Pages 190-201
On Some Proximity Problems of Colored Sets....Pages 202-213
An Extended Strange Planet Protocol....Pages 214-225
Online Bin Covering: Expectations vs. Guarantees....Pages 226-237
Map of Geometric Minimal Cuts for General Planar Embedding....Pages 238-249
A New Approach to the Upper Bound on the Average Distance from the Fermat-Weber Center of a Convex Body....Pages 250-259
Parameterized Complexity of Control and Bribery for d -Approval Elections....Pages 260-271
Circular Convex Bipartite Graphs: Feedback Vertex Set....Pages 272-283
The Multi-parameterized Cluster Editing Problem....Pages 284-294
Fast Order-Preserving Pattern Matching....Pages 295-305
Scheduling for Electricity Cost in Smart Grid....Pages 306-317
Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems....Pages 318-329
An Optimal Single-Machine Scheduling with Linear Deterioration Rate and Rate-Modifying Activities....Pages 330-339
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously....Pages 340-350
Touring Disjoint Polygons Problem Is NP-Hard....Pages 351-360
Walking in Streets with Minimal Sensing....Pages 361-372
Robust Optimization for the Hazardous Materials Transportation Network Design Problem....Pages 373-386
Online Bin Packing with (1,1) and (2, R ) Bins....Pages 387-401
Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation....Pages 402-413
A Portable Parallel Implementation of the lrs Vertex Enumeration Code....Pages 414-429
Back Matter....Pages -

✦ Subjects

Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Numeric Computing; Algorithms; Computer Communication Networks; Computer Graphics