Combinatorial Optimization and Application

by Dress, Andreas; Xu, Yinfeng; Zhu, Binhai

• ISBN13: 9783540735557
• ISBN10: 3540735550
• Format: Paperback
• Copyright: 2007-09-03
• Publisher: Springer-Verlag New York Inc

Summary

This book constitutes the refereed proceedings of the First International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August 2007. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions. The papers feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.

Table of Contents

Invited Lecture
Matchings in Graphs Variations of the Problem	p. 1
Combinatorics from Bacterial Genomes	p. 3
Contributed Papers
An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces	p. 4
Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes	p. 11
K-Connected Target Coverage Problem in Wireless Sensor Networks	p. 20
Searching Cycle-Disjoint Graphs	p. 32
An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan	p. 44
A New Dynamic Programming Algorithm for Multiple Sequence Alignment	p. 52
Energy Minimizing Vehicle Routing Problem	p. 62
On the On-Line k-Taxi Problem with Limited Look Ahead	p. 72
The Minimum Risk Spanning Tree Problem	p. 81
The Size of a Minimum Critically m-Neighbor-Scattered Graph	p. 91
A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition	p. 102
Steiner Forests on Stochastic Metric Graphs	p. 112
On Threshold BDDs and the Optimal Variable Ordering Problem	p. 124
Communication Leading to Nash Equilibrium Through Robust Messages - S5-Knowledge Model Case	p. 136
Fundamental Domains for Integer Programs with Symmetries	p. 146
Exact Algorithms for Generalized Combinatorial Optimization Problems	p. 154
Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders	p. 163
A Grid Resource Discovery Method Based on Adaptive k-Nearest Neighbors Clustering	p. 171
Algorithms for Minimum m-Connected k-Dominating Set Problem	p. 182
Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem	p. 191
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp	p. 200
Mechanism Design by Creditability	p. 208
Infinite Families of Optimal Double-Loop Networks	p. 220
Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points	p. 230
An Experimental Study of Compressed Indexing and Local Alignments of DNA	p. 242
Secure Multiparty Computations Using the 15 Puzzle (Extended Abstract)	p. 255
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem	p. 267
Single Machine Common Due Window Scheduling with Controllable Job Processing Times	p. 279
A Lower Bound on Approximation Algorithms for the Closest Substring Problem	p. 291
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem	p. 301
Improved Approximation Algorithm for Connected Facility Location Problems (Extended Abstract)	p. 311
The Computational Complexity of Game Trees by Eigen-Distribution	p. 323
The Minimum All-Ones Problem for Graphs with Small Treewidth	p. 335
An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem	p. 343
Arc Searching Digraphs Without Jumping	p. 354
On the Complexity of Some Colorful Problems Parameterized by Treewidth	p. 366
A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model	p. 378
Author Index	p. 389
Table of Contents provided by Ingram. All Rights Reserved.