Algorithms - ESA 2003

11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003. Proceedings

Editors:

ISBN: 978-3-540-20064-2 (Print) 978-3-540-39658-1 (Online)

Table of contents (69 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-1

      Sublinear Computing

    2. No Access

      Book Chapter

      Pages 2-5

      Authenticated Data Structures

    3. No Access

      Book Chapter

      Pages 6-6

      Approximation Algorithms and Network Games

  3. Contributed Papers: Design and Analysis Track

    1. No Access

      Book Chapter

      Pages 7-18

      I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

    2. No Access

      Book Chapter

      Pages 19-30

      Line System Design and a Generalized Coloring Problem

    3. No Access

      Book Chapter

      Pages 31-42

      Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties

    4. No Access

      Book Chapter

      Pages 43-54

      Scheduling for Flow-Time with Admission Control

    5. No Access

      Book Chapter

      Pages 55-66

      On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows

    6. No Access

      Book Chapter

      Pages 67-77

      Semi-clairvoyant Scheduling

    7. No Access

      Book Chapter

      Pages 78-89

      Algorithms for Graph Rigidity and Scene Analysis

    8. No Access

      Book Chapter

      Pages 90-101

      Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting

    9. No Access

      Book Chapter

      Pages 102-113

      Multi-player and Multi-round Auctions with Severely Bounded Communication

    10. No Access

      Book Chapter

      Pages 114-126

      Network Lifetime and Power Assignment in ad hoc Wireless Networks

    11. No Access

      Book Chapter

      Pages 127-135

      Disjoint Unit Spheres admit at Most Two Line Transversals

    12. No Access

      Book Chapter

      Pages 136-147

      An Optimal Algorithm for the Maximum-Density Segment Problem

    13. No Access

      Book Chapter

      Pages 148-160

      Estimating Dominance Norms of Multiple Data Streams

    14. No Access

      Book Chapter

      Pages 161-171

      Smoothed Motion Complexity

    15. No Access

      Book Chapter

      Pages 172-183

      Kinetic Dictionaries: How to Shoot a Moving Target

    16. No Access

      Book Chapter

      Pages 184-195

      Deterministic Rendezvous in Graphs

    17. No Access

      Book Chapter

      Pages 196-207

      Fast Integer Programming in Fixed Dimension

previous Page of 4