Skip to main content
SpringerLink
Log in
Book cover

Algorithms and Data Structures

7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Frank Dehne

    1. School of Computer Science, Carleton University, Ottawa, Candada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jörg-Rüdiger Sack

    1. School of Computer Science, Carleton University, Ottawa, Candada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Roberto Tamassia

    1. Center for Geometric Computing, Brown University, Providence, USA

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

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

Licence this eBook for your library

Institutional subscriptions

Table of contents (43 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Session 1 - Invited Talk

    1. Approximation of Multiobjective Optimization Problems

      • Mihalis Yannakakis
      Pages 1-1

  3. Session 2A

    1. Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs

      • Ferran Hurtado, Giuseppe Liotta, Henk Meijer
      Pages 2-13

    2. Optimal Möbius Transformations for Information Visualization and Meshing

      • Marshall Bern, David Eppstein
      Pages 14-25

  4. Session 2B

    1. Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming

      • Philip M. Long
      Pages 26-37

    2. On the Complexity of Scheduling Conditional Real-Time Code

      • Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele
      Pages 38-49

  5. Session 3A

    1. Time Responsive External Data Structures for Moving Points

      • Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold
      Pages 50-61

    2. Voronoi Diagrams for Moving Disks and Applications

      • Menelaos I. Karavelas
      Pages 62-74

  6. Session 3B

    1. Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover

      • Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
      Pages 75-86

    2. Deciding Clique-Width for Graphs of Bounded Tree-Width

      • Wolfgang Espelage, Frank Gurski, Egon Wanke
      Pages 87-98

  7. Session 4A

    1. Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions

      • Vladlen Koltun
      Pages 99-110

    2. Optimization over Zonotopes and Training Support Vector Machines

      • Marshall Bern, David Eppstein
      Pages 111-121

    3. Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions

      • Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
      Pages 122-134

  8. Session 4B

    1. Seller-Focused Algorithms for Online Auctioning

      • Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar
      Pages 135-147

    2. Competitive Analysis of the LRFU Paging Algorithm

      • Edith Cohen, Haim Kaplan, Uri Zwick
      Pages 148-154

    3. Admission Control to Minimize Rejections

      • Avrim Blum, Adam Kalai, Jon Kleinberg
      Pages 155-164

  9. Session 5 - Invited Talk

    1. Secure Multi-party Computational Geometry

      • Mikhail J. Atallah, Wenliang Du
      Pages 165-179

  10. Session 6A

    1. The Grid Placement Problem

      • Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
      Pages 180-191

    2. On the Reflexivity of Point Sets

      • Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán et al.
      Pages 192-204

  11. Session 6B

    1. A 7/8-Approximation Algorithm for Metric Max TSP

      • Refael Hassin, Shlomi Rubinstein
      Pages 205-209
Back to top

Keywords

Editors and Affiliations

  • School of Computer Science, Carleton University, Ottawa, Candada

    Frank Dehne, Jörg-Rüdiger Sack

  • Center for Geometric Computing, Brown University, Providence, USA

    Roberto Tamassia

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation