Algorithm Theory - SWAT 2000

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

ISBN: 978-3-540-67690-4 (Print) 978-3-540-44985-0 (Online)

Table of contents (46 chapters)

previous Page of 3
  1. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-9

      Dynamic Graph Algorithms with Applications

    2. No Access

      Book Chapter

      Pages 10-19

      Coping with the NP-Hardness of the Graph Bandwidth Problem

    3. No Access

      Book Chapter

      Pages 20-21

      Toward Complete Genome Data Mining in Computational Biology

  2. Data Structures

    1. No Access

      Book Chapter

      Pages 22-31

      A New Trade-Off for Deterministic Dictionaries

    2. No Access

      Book Chapter

      Pages 32-45

      Improved Upper Bounds for Pairing Heaps

    3. No Access

      Book Chapter

      Pages 46-56

      Maintaining Center and Median in Dynamic Trees

    4. No Access

      Book Chapter

      Pages 57-70

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

  3. Graph Algorithms

    1. No Access

      Book Chapter

      Pages 71-82

      A Dynamic Algorithm for Maintaining Graph Partitions

    2. No Access

      Book Chapter

      Pages 83-96

      Data Structures for Maintaining Set Partitions

  4. Graph Algorithms

    1. No Access

      Book Chapter

      Pages 97-110

      Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

    2. No Access

      Book Chapter

      Pages 111-124

      Embeddings of k-Connected Graphs of Pathwidth k

    3. No Access

      Book Chapter

      Pages 125-138

      On Graph Powers for Leaf-Labeled Trees

    4. No Access

      Book Chapter

      Pages 139-149

      Recognizing Weakly Triangulated Graphs by Edge Separability

  5. Online Algorithms

    1. No Access

      Book Chapter

      Pages 150-163

      Caching for Web Searching

    2. No Access

      Book Chapter

      Pages 164-174

      On-Line Scheduling with Precedence Constraints

    3. No Access

      Book Chapter

      Pages 175-188

      Scheduling Jobs Before Shut-Down

    4. No Access

      Book Chapter

      Pages 189-199

      Resource Augmentation in Load Balancing

    5. No Access

      Book Chapter

      Pages 200-213

      Fair versus Unrestricted Bin Packing

  6. Approximation Algorithms

    1. No Access

      Book Chapter

      Pages 214-219

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

    2. No Access

      Book Chapter

      Pages 220-231

      Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems

previous Page of 3