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. Robotics

    1. Robot Localization without Depth Perception

      • Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
      Pages 249-259
    2. Online Parallel Heuristics and Robot Searching under the Competitive Framework

      • Alejandro López-Ortiz, Sven Schuierer
      Pages 260-269
    3. Analysis of Heuristics for the Freeze-Tag Problem

      • Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell
      Pages 270-279
  2. Approximation Algorithms

    1. Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems

      • Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko
      Pages 280-287
    2. All-Norm Approximation Algorithms

      • Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
      Pages 288-297
    3. Approximability of Dense Instances of Nearest Codeword Problem

      • 1Cristina Bazgan, W. Fernandez de la Vega, Marek Karpinski
      Pages 298-307
  3. Data Communication

    1. Call Control with k Rejections

      • R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
      Pages 308-317
    2. On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem

      • Guy Even, Guy Kortsarz, Wolfgang Slany
      Pages 318-327
    3. Packet Bundling

      • Jens S. Frederiksen, Kim S. Larsen
      Pages 328-337
    4. Algorithms for the Multi-constrained Routing Problem

      • Anuj Puri, Stavros Tripakis
      Pages 338-347
  4. Computational Biology

    1. Computing the Threshold for q-Gram Filters

      • Juha Kärkkäinen
      Pages 348-357
    2. On the Generality of Phylogenies from Incomplete Directed Characters

      • Itsik Pe’er, Ron Shamir, Roded Sharan
      Pages 358-367
  5. Data Storage and Manipulation

    1. Sorting with a Forklift

      • M. H. Albert, M. D. Atkinson
      Pages 368-377
    2. Tree Decompositions with Small Cost

      • Hans L. Bodlaender, Fedor V. Fomin
      Pages 378-387

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