Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Algorithm Theory – SWAT 2008

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

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Joachim Gudmundsson
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SWAT 2008.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 129.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Front Matter

    Download chapter PDF

  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
Back to top

Other volumes

  1. Algorithm Theory – SWAT 2008

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation