Combinatorial Optimization and Applications: Second International Conference, Cocoa 2008, St. John's, Nl, Canada, August 21-24, 2008, Proceedings

ISBN-13: 9783540850960 / Angielski / Miękka / 2008 / 480 str.

Boting Yang

Opis

ThepapersinthisvolumewerepresentedattheSecondInternationalConference on Combinatorial Optimization and Applications (COCOA 2008), held August 21-24, 2008, in St. John's, Newfoundland, Canada. The topics cover most areas in combinatorial optimization and applications. A total of 84 papers were submitted, of which 44 were accepted for presen- tionattheconference.Theselectionwasbasedonthepapers'originality, quality and relevance to combinatorial optimization. The papers were evaluated by an international Program Committee consisting of Tetsuo Asano, Sergey Bereg, Binay Bhattacharya, Hans Bodlaender, Leizhen Cai, Bo Chen, Zhixiang Chen, FrancisChin, Kyung-YongChwa, AndreasDress, Ding-ZhuDu, MichaelFellows, FedorFomin, Gena Hahn, PavolHell, Wen-LianHsu, MinghuiJiang, Ming-Yang Kao, EvangelosKranakis, MichaelLangston, GuohuiLin, RolfH.Mo ]hring, X- hou Tan, Dimitrios M. Thilikos, Adrian Vetta, Cao An Wang, Lusheng Wang, Todd Wareham, Peter Widmayer, Jinhui Xu, Yinfeng Xu, Boting Yang, Yinyu Ye, Guochuan Zhang, Xiao Zhou, and Binhai Zhu. It is expected that most of the accepted papers will appear in a more complete form in scienti?c journals. We received papers from Algeria, Austria, Bangladesh, Belgium, Brazil, Canada, China, Egypt, France, Germany, Hong Kong, India, Indonesia, Iran, Israel, Italy, Japan, Korea, Norway, Oman, Pakistan, Romania, Russia, Singapore, South Africa, Spain, Sweden, Switzerland, Taiwan, UK, and USA. Each paper was evaluated by at least three Program Committee members, assisted in some cases by external referees. In addition to the selected papers, the conference also included twoinvited presentationsby FrancisY.L. Chin andVijay V. Vazirani. We thank all the people who have made this meeting possible: the authors for submitting papers, the Program Committee members and external referees (listed in the proceedings)for their excellent work, and the two invited speakers. Finally, we thank the Memorial University of Newfoundland for their support and the local organizers and their colleagues for their assistance.

Spis treści

Going Weighted: Parameterized Algorithms for Cluster Editing.- Parameterized Graph Editing with Chosen Vertex Degrees.- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries.- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets.- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems.- A Parameterized Perspective on Packing Paths of Length Two.- New Algorithms for k-Center and Extensions.- Separating Sublinear Time Computations by Approximate Diameter.- Computational Study on Dominating Set Problem of Planar Graphs.- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region.- Parameterized Algorithms for Generalized Domination.- Turán Graphs, Stability Number, and Fibonacci Index.- Vertex-Uncertainty in Graph-Problems.- Protean Graphs with a Variety of Ranking Schemes.- Simplicial Powers of Graphs.- On k- Versus (k?+?1)-Leaf Powers.- Flows with Unit Path Capacities and Related Packing and Covering Problems.- Strong Formulations for 2-Node-Connected Steiner Network Problems.- Algorithms and Implementation for Interconnection Graph Problem.- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks.- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph.- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem.- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs.- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.- Covering Arrays Avoiding Forbidden Edges.- The Robot Cleans Up.- On Recovering Syntenic Blocks from Comparative Maps.- Automatic Generation of Symmetry-Breaking Constraints.- On the Stable Set Polytope of Claw-Free Graphs.- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs.- Magic Labelings on Cycles and Wheels.- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.- The Clique Corona Operation and Greedoids.- On the Surface Area of the (n, k)-Star Graph.- Enumerating Isolated Cliques in Synthetic and Financial Networks.- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem.- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays.- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization.- Stochastic Online Scheduling Revisited.- Delay Management Problem: Complexity Results and Robust Algorithms.- Clustered SplitsNetworks.

Blurb

This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008.

The 44 revised full papers were carefully reviewed and selected from 84 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.