Skip to main content
  • Conference proceedings
  • © 2002

Algorithm Theory - SWAT 2002

8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings

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

Conference series link(s): SWAT: Scandinavian Workshop on Algorithm Theory

Conference proceedings info: SWAT 2002.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
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

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

Table of contents (45 papers)

  1. Front Matter

    Pages I-XIV
  2. Invited Speakers

    1. An Efficient Quasidictionary

      • Torben Hagerup, Rajeev Raman
      Pages 1-18
  3. Scheduling

    1. Time and Space Efficient Multi-method Dispatching

      • Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe
      Pages 20-29
    2. Linear Time Approximation Schemes for Vehicle Scheduling

      • John E. Augustine, Steven S. Seiden
      Pages 30-39
    3. Minimizing Makespan for the Lazy Bureaucrat Problem

      • Clint Hepner, Cliff Stein
      Pages 40-50
  4. Computational Geometry

    1. Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D

      • Partha P. Goswami, Sandip Das, Subhas C. Nandy
      Pages 69-79
    2. Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains

      • Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell
      Pages 80-89
    3. Optimal Algorithm for a Special Point-Labeling Problem

      • Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
      Pages 110-120
    4. Random Arc Allocation and Applications

      • Peter Sanders, Berthold Vöcking
      Pages 121-130
    5. On Neighbors in Geometric Permutations

      • Micha Sharir, Shakhar Smorodinsky
      Pages 131-139
  5. Graph Algorithms

    1. Powers of Geometric Intersection Graphs and Dispersion Algorithms

      • Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson
      Pages 140-149
    2. Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case

      • Jochen Alber, Michael R. Fellows, Rolf Niedermeier
      Pages 150-159
    3. Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous

      • Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
      Pages 160-169
    4. Approximation Hardness of the Steiner Tree Problem on Graphs

      • Miroslav Chlebík, Janka Chlebíková
      Pages 170-179

Other Volumes

  1. Algorithm Theory — SWAT 2002

Editors and Affiliations

  • Department of Computer Science and Applied Mathematics, University of Kuopio, Kuopio, Finland

    Martti Penttonen

  • BRICS, University of Aarhus, Department of Computer Science, Aarhus C, Denmark

    Erik Meineche Schmidt

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
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