Document - eBookmela
Loading...

Algorithms and data structures : 7th International Workshop, WADS 2001, Providence, RI, USA, August 8 10, 2001 | WADS 2001 (2001 : Providence, R.I.), Dehne, F. (Frank), 1960-, Sack, J.-R. (Jörg-Rüdiger), 1954-, Tamassia, Roberto, 1960-

Likes0
Telegram icon Share on Telegram

Algorithms and data structures : 7th International Workshop, WADS 2001, Providence, RI, USA, August 8 10, 2001

User Rating: Be the first one!

Author: WADS 2001 (2001 : Providence, R.I.), Dehne, F. (Frank), 1960-, Sack, J.-R. (Jörg-Rüdiger), 1954-, Tamassia, Roberto, 1960-

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2001

Language: eng

Subjects: Data structures (Computer science), Computer algorithms

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540424237

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 250.26 MB

PDF Size: 7.2 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 811

Views: 861

Total Files: 18

Media Type: texts

Description

Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8–10, 2001 Proceedings
Author: Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42423-9
DOI: 10.1007/3-540-44634-6

Table of Contents:

  • Approximation of Multiobjective Optimization Problems
  • Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs
  • Optimal Möbius Transformations for Information Visualization and Meshing
  • Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
  • On the Complexity of Scheduling Conditional Real-Time Code
  • Time Responsive External Data Structures for Moving Points
  • Voronoi Diagrams for Moving Disks and Applications
  • Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
  • Deciding Clique-Width for Graphs of Bounded Tree-Width
  • Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
  • Optimization over Zonotopes and Training Support Vector Machines
  • Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
  • Seller-Focused Algorithms for Online Auctioning
  • Competitive Analysis of the LRFU Paging Algorithm
  • Admission Control to Minimize Rejections
  • Secure Multi-party Computational Geometry
  • The Grid Placement Problem
  • On the Reflexivity of Point Sets
  • A 7/8-Approximation Algorithm for Metric Max TSP
  • Approximating Multi-objective Knapsack Problems

Includes bibliographical references and index
eBookmela
Logo
Register New Account