Kurt Mehlhorn (auth.), Andreas Dress, Yinfeng Xu, Binhai Zhu (eds.)3540735550, 9783540735557
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 :
Front Matter….Pages –
Matchings in Graphs Variations of the Problem….Pages 1-2
Combinatorics from Bacterial Genomes….Pages 3-3
An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces….Pages 4-10
Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes….Pages 11-19
K -Connected Target Coverage Problem in Wireless Sensor Networks….Pages 20-31
Searching Cycle-Disjoint Graphs….Pages 32-43
An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan….Pages 44-51
A New Dynamic Programming Algorithm for Multiple Sequence Alignment….Pages 52-61
Energy Minimizing Vehicle Routing Problem….Pages 62-71
On the On-Line k -Taxi Problem with Limited Look Ahead….Pages 72-80
The Minimum Risk Spanning Tree Problem….Pages 81-90
The Size of a Minimum Critically m -Neighbor-Scattered Graph….Pages 91-101
A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition….Pages 102-111
Steiner Forests on Stochastic Metric Graphs….Pages 112-123
On Threshold BDDs and the Optimal Variable Ordering Problem….Pages 124-135
Communication Leading to Nash Equilibrium Through Robust Messages – S5 -Knowledge Model Case –….Pages 136-145
Fundamental Domains for Integer Programs with Symmetries….Pages 146-153
Exact Algorithms for Generalized Combinatorial Optimization Problems….Pages 154-162
Approximation Algorithms for k -Duplicates Combinatorial Auctions with Subadditive Bidders….Pages 163-170
A Grid Resource Discovery Method Based on Adaptive k -Nearest Neighbors Clustering….Pages 171-181
Algorithms for Minimum m -Connected k -Dominating Set Problem….Pages 182-190
Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem….Pages 191-199
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp….Pages 200-207
Mechanism Design by Creditability….Pages 208-219
Infinite Families of Optimal Double-Loop Networks….Pages 220-229
Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points….Pages 230-241
An Experimental Study of Compressed Indexing and Local Alignments of DNA….Pages 242-254
Secure Multiparty Computations Using the 15 Puzzle….Pages 255-266
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem….Pages 267-278
Single Machine Common Due Window Scheduling with Controllable Job Processing Times….Pages 279-290
A Lower Bound on Approximation Algorithms for the Closest Substring Problem….Pages 291-300
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem….Pages 301-310
Improved Approximation Algorithm for Connected Facility Location Problems….Pages 311-322
The Computational Complexity of Game Trees by Eigen-Distribution….Pages 323-334
The Minimum All-Ones Problem for Graphs with Small Treewidth….Pages 335-342
An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem….Pages 343-353
Arc Searching Digraphs Without Jumping….Pages 354-365
On the Complexity of Some Colorful Problems Parameterized by Treewidth….Pages 366-377
A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model….Pages 378-387
Back Matter….Pages –
Reviews
There are no reviews yet.