Combinatorial Optimization and Applications

First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings

404 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Informatik Theoretische Informatik Mathematik für Informatiker
• ISBN: 9783540735557
• Sprache: Englisch
• Erscheinungsdatum: 25.07.2007
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Andreas Dress, Yinfeng Xu, Binhai Zhu