Algorithm Theory – SWAT 2008

11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008. Proceedings

  • Editors
  • Joachim Gudmundsson
Conference proceedings SWAT 2008

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

Table of contents

  1. Front Matter
    PDF

  2. Invited Lectures

    1. A Survey of Results for Deletion Channels and Related Synchronization Channels
      Michael Mitzenmacher
      Pages 1-3
    2. Nash Bargaining Via Flexible Budget Markets
      Vijay V. Vazirani
      Pages 4-4

  3. Contributed Papers

    1. Simplified Planar Coresets for Data Streams
      John Hershberger, Subhash Suri
      Pages 5-16
    2. Uniquely Represented Data Structures for Computational Geometry
      Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska
      Pages 17-28
    3. I/O Efficient Dynamic Data Structures for Longest Prefix Queries
      Moshe Hershcovitch, Haim Kaplan
      Pages 29-40
    4. Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
      Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
      Pages 41-52
    5. Vision-Based Pursuit-Evasion in a Grid
      Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Paweł Żyliński
      Pages 53-64
    6. Angle Optimization in Target Tracking
      Beat Gfeller, Matúš Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
      Pages 65-76
    7. Improved Bounds for Wireless Localization
      Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
      Pages 77-89
    8. Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
      Yuval Rabani, Gabriel Scalosub
      Pages 90-101
    9. Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
      Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen
      Pages 102-113
    10. The Maximum Energy-Constrained Dynamic Flow Problem
      Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller
      Pages 114-126
    11. Bounded Unpopularity Matchings
      Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
      Pages 127-137
    12. Data Structures with Local Update Operations
      Yakov Nekrich
      Pages 138-147
    13. On the Redundancy of Succinct Data Structures
      Alexander Golynski, Rajeev Raman, S. Srinivasa Rao
      Pages 148-159
    14. Confluently Persistent Tries for Efficient Version Control
      Erik D. Demaine, Stefan Langerman, Eric Price
      Pages 160-172
    15. A Uniform Approach Towards Succinct Representation of Trees
      Arash Farzan, J. Ian Munro
      Pages 173-184
    16. An \(\mbox{O}(n^{1.75})\) Algorithm for L(2,1)-Labeling of Trees
      Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
      Pages 185-197
    17. Batch Coloring Flat Graphs and Thin
      Magnús M. Halldórsson, Hadas Shachnai
      Pages 198-209

About these proceedings

Keywords

algorithmic game theory algorithmics algorithms approximation art gallery clustering combinatorial algorithms complexity computational discrete mathematics computational geometry computational graph theory data structures distributed algorithms dynamic flows facility location

Bibliographic information

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