Skip to main content
SpringerLink
Log in
Book cover

Algorithm Theory - SWAT 2000

7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Magnus M. Halldorsson

    1. University of Iceland, Reykjavik, Iceland

    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 1851)

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (46 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Invited Talks

    1. Dynamic Graph Algorithms with Applications

      • Mikkel Thorup, David R. Karger
      Pages 1-9

    2. Coping with the NP-Hardness of the Graph Bandwidth Problem

      • Uriel Feige
      Pages 10-19

    3. Toward Complete Genome Data Mining in Computational Biology

      • Esko Ukkonen
      Pages 20-21

  3. Data Structures

    1. A New Trade-Off for Deterministic Dictionaries

      • Rasmus Pagh
      Pages 22-31

    2. Improved Upper Bounds for Pairing Heaps

      • John Iacono
      Pages 32-45

    3. Maintaining Center and Median in Dynamic Trees

      • Stephen Alstrup, Jacob Holm, Mikkel Thorup
      Pages 46-56

    4. Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n) Update Time

      • Gerth Stølting Brodal, Riko Jacob
      Pages 57-70

  4. Graph Algorithms

    1. A Dynamic Algorithm for Maintaining Graph Partitions

      • Lyudmil G. Aleksandrov, Hristo_N. Djidjev
      Pages 71-82

    2. Data Structures for Maintaining Set Partitions

      • Michael A. Bender, Saurabh Sethia, Steven Skiena
      Pages 83-96

  5. Graph Algorithms

    1. Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

      • Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
      Pages 97-110

    2. Embeddings of k-Connected Graphs of Pathwidth k

      • Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
      Pages 111-124

    3. On Graph Powers for Leaf-Labeled Trees

      • Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
      Pages 125-138

    4. Recognizing Weakly Triangulated Graphs by Edge Separability

      • Anne Berry, Jean-Paul Bordat, Pinar Heggernes
      Pages 139-149

  6. Online Algorithms

    1. Caching for Web Searching

      • Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard Woeginger†
      Pages 150-163

    2. On-Line Scheduling with Precedence Constraints

      • Yossi Azar, Leah Epstein
      Pages 164-174

    3. Scheduling Jobs Before Shut-Down

      • Vincenzo Liberatore
      Pages 175-188

    4. Resource Augmentation in Load Balancing

      • Yossi Azar, Leah Epstein, Rob van Stee
      Pages 189-199

    5. Fair versus Unrestricted Bin Packing

      • Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
      Pages 200-213

  7. Approximation Algorithms

    1. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs

      • Piotr Berman
      Pages 214-219
Back to top

Keywords

Editors and Affiliations

  • University of Iceland, Reykjavik, Iceland

    Magnus M. Halldorsson

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation