Advertisement

Combinatorial Optimization and Applications

Second International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings

  • Editors
  • Boting Yang
  • Ding-Zhu Du
  • Cao An Wang
Conference proceedings COCOA 2008

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5165)

Table of contents

  1. Front Matter
    PDF
  2. Going Weighted: Parameterized Algorithms for Cluster Editing
    Sebastian Böcker, Sebastian Briesemeister, Quang B. A. Bui, Anke Truss
    Pages 1-12
  3. Parameterized Graph Editing with Chosen Vertex Degrees
    Luke Mathieson, Stefan Szeider
    Pages 13-22
  4. Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
    Rhonda Chaytor, Patricia A. Evans, Todd Wareham
    Pages 23-31
  5. Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
    Peter Damaschke
    Pages 32-42
  6. Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
    Nadja Betzler, Johannes Uhlmann
    Pages 43-53
  7. A Parameterized Perspective on Packing Paths of Length Two
    Henning Fernau, Daniel Raible
    Pages 54-63
  8. New Algorithms for k-Center and Extensions
    René Brandenberg, Lucia Roth
    Pages 64-78
  9. Separating Sublinear Time Computations by Approximate Diameter
    Bin Fu, Zhiyu Zhao
    Pages 79-88
  10. Computational Study on Dominating Set Problem of Planar Graphs
    Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
    Pages 89-102
  11. Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
    B. Bhattacharya, B. Burmester, Y. Hu, E. Kranakis, Q. Shi, A. Wiese
    Pages 103-115
  12. Parameterized Algorithms for Generalized Domination
    Venkatesh Raman, Saket Saurabh, Sriganesh Srihari
    Pages 116-126
  13. Turán Graphs, Stability Number, and Fibonacci Index
    Véronique Bruyère, Hadrien Mélot
    Pages 127-138
  14. Vertex-Uncertainty in Graph-Problems
    Cécile Murat, Vangelis Th. Paschos
    Pages 139-148
  15. Protean Graphs with a Variety of Ranking Schemes
    Paweł Prałat
    Pages 149-159
  16. Simplicial Powers of Graphs
    Andreas Brandstädt, Van Bang Le
    Pages 160-170
  17. On k- Versus (k + 1)-Leaf Powers
    Andreas Brandstädt, Peter Wagner
    Pages 171-179
  18. Flows with Unit Path Capacities and Related Packing and Covering Problems
    Maren Martens, Martin Skutella
    Pages 180-189
  19. Strong Formulations for 2-Node-Connected Steiner Network Problems
    Markus Chimani, Maria Kandyba, Ivana Ljubić, Petra Mutzel
    Pages 190-200
  20. Algorithms and Implementation for Interconnection Graph Problem
    Hongbing Fan, Christian Hundt, Yu-Liang Wu, Jason Ernst
    Pages 201-210
  21. Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
    Gerold Jäger, Paul Molitor
    Pages 211-224
  22. Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks
    Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
    Pages 225-234
  23. Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks
    Xiangyong Li, Yash Aneja, Fazle Baki
    Pages 235-245
  24. Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
    Shai Gutner
    Pages 246-254
  25. Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
    Zhao Zhang, Xiaofeng Gao, Weili Wu
    Pages 255-264
  26. Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
    Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa
    Pages 265-277
  27. Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
    Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu
    Pages 278-285
  28. An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
    Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang
    Pages 286-295
  29. Covering Arrays Avoiding Forbidden Edges
    Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens
    Pages 296-308
  30. The Robot Cleans Up
    Margaret-Ellen Messinger, Richard J. Nowakowski
    Pages 309-318
  31. On Recovering Syntenic Blocks from Comparative Maps
    Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu
    Pages 319-327
  32. Automatic Generation of Symmetry-Breaking Constraints
    Leo Liberti
    Pages 328-338
  33. On the Stable Set Polytope of Claw-Free Graphs
    Anna Galluccio, Claudio Gentile, Paolo Ventura
    Pages 339-350
  34. A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
    Caterina De Simone, Anna Galluccio
    Pages 351-360
  35. Magic Labelings on Cycles and Wheels
    Andrew Baker, Joe Sawada
    Pages 361-373
  36. Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
    A. Gupta, M. Karimi, E. J. Kim, A. Rafiey
    Pages 374-383
  37. The Clique Corona Operation and Greedoids
    Vadim E. Levit, Eugen Mandrescu
    Pages 384-392
  38. On the Surface Area of the (n, k)-Star Graph
    Zhizhang Shen, Ke Qiu, Eddie Cheng
    Pages 393-404
  39. Enumerating Isolated Cliques in Synthetic and Financial Networks
    Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
    Pages 405-416
  40. A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
    Bing Su, Yinfeng Xu, Peng Xiao, Lei Tian
    Pages 417-426
  41. Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
    Yumei Huo, Haibing Li, Hairong Zhao
    Pages 427-437
  42. Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
    Karine Deschinkel, Sid-Ahmed-Ali Touati
    Pages 438-447
  43. Stochastic Online Scheduling Revisited
    Andreas S. Schulz
    Pages 448-457
  44. Delay Management Problem: Complexity Results and Robust Algorithms
    Serafino Cicerone, Gianlorenzo D’Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
    Pages 458-468
  45. Clustered SplitsNetworks
    Lichen Bao, Sergey Bereg
    Pages 469-478
  46. Back Matter
    PDF

About these proceedings

Introduction

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.

Keywords

algorithm algorithms ant colony optimization approximation bioinformatics classification combinatorial optimization competitive analysis complexity theory computational biology computational complexity computational discrete mathematics computational fin optimization

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-85097-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-85096-0
  • Online ISBN 978-3-540-85097-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site