Skip to main content
SpringerLink
Log in
Book cover

Algorithm Theory - SWAT'98

6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 8-10, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Stefan Arnborg
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Lars Ivansson
    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 1432)

Included in the following conference series:

Conference proceedings info: SWAT 1998.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (31 papers)

  1. Front Matter

    Download chapter PDF

  2. Recent developments in maximum flow algorithms

    • Andrew V. Goldberg
    Pages 1-10

  3. An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces

    • Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg -R. Sack
    Pages 11-22

  4. Facility location with dynamic distance functions

    • Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
    Pages 23-34

  5. An approximation scheme for bin packing with conflicts

    • Klaus Jansen
    Pages 35-46

  6. Approximations for the general block distribution of a matrix

    • Bengt Aspvall, MagnÚs M. Halldórsson, Fredrik Manne
    Pages 47-58

  7. An optimal algorithm for computing visible nearest foreign neighbors among colored line segments

    • Thorsten Graf, Kamakoti Veezhinathan
    Pages 59-70

  8. Moving an angle around a region

    • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    Pages 71-82

  9. Models and motion planning

    • Mark de Berg, Matthew J. Katz, Mark Overmars, A. Frank van der Stappen, Jules Vleugels
    Pages 83-94

  10. Constrained square-center problems

    • Matthew J. Katz, Klara Kedem, Michael Segal
    Pages 95-106

  11. Worst-case efficient external-memory priority queues

    • Gerth Stølting Brodal, Jyrki Katajainen
    Pages 107-118

  12. Simple confluently persistent catenable lists

    • Haim Kaplan, Chris Okasaki, Robert E. Tarjan
    Pages 119-130

  13. Improved upper bounds for time-space tradeoffs for selection with limited storage

    • Venkatesh Raman, Sarnath Ramnath
    Pages 131-142

  14. Probabilistic data structures for priority queues

    • R. Sridhar, K. Rajasekar, C. Pandu Rangan
    Pages 143-154

  15. Extractors for weak random sources and their applications

    • David Zuckerman
    Pages 155-157

  16. Comparator networks for binary heap construction

    • Gerth Stølting Brodal, M. Cristina Pinotti
    Pages 158-168

  17. Two-variable linear programming in parallel

    • Danny Z. Chen, Jinhui Xu
    Pages 169-180

  18. Optimal deterministic protocols for mobile robots on a grid

    • Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
    Pages 181-192

  19. Concurrent multicast in weighted networks

    • Gianluca De Marco, Luisa Gargano, Ugo Vaccaro
    Pages 193-204

  20. Some recent strong inapproximability results

    • Johan HÃ¥stad
    Pages 205-209
Back to top

Other volumes

  1. Algorithm Theory — SWAT'98

Keywords

About this book

This book constitutes the refereed proceedings of the 6th Scandinavian Workshop on Algorithm Theory, SWAT'98, held in Stockholm, Sweden, in July 1998.
The volume presents 28 revised full papers selected from 56 submissions; also included are three invited contributions. The papers present original research on algorithms and data structures in various areas including computational geometry, parallel and distributed systems, graph theory, approximation, computational biology, queueing, Voronoi diagrams, and combinatorics in general.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation