Algorithms and data structures : 7th International Workshop, WADS 2001 Providence, RI, USA, August 8 10, 2001 : proceedings
שמור ב:
| מחבר תאגידי: | |
|---|---|
| מחברים אחרים: | , , |
| פורמט: | Livre numérique |
| שפה: | Anglais |
| יצא לאור: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| סדרה: | Lecture notes in computer science
2125 |
| נושאים: | |
| גישה מקוונת: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| הערה: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms and data structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, proceedings, Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia (eds.), 2001, New York, Springer, 1 vol. (XII-484 p.), Lecture notes in computer science, 3-540-42423-7 • Algorithms and Data Structures, Texte imprimé, 9783662201961 |
תוכן הענינים:
- Session 1 - Invited Talk
- Approximation of Multiobjective Optimization Problems
- Session 2A
- Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs
- Optimal Möbius Transformations for Information Visualization and Meshing
- Session 2B
- Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
- On the Complexity of Scheduling Conditional Real-Time Code
- Session 3A
- Time Responsive External Data Structures for Moving Points
- Voronoi Diagrams for Moving Disks and Applications
- Session 3B
- Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
- Deciding Clique-Width for Graphs of Bounded Tree-Width
- Session 4A
- 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
- Session 4B
- Seller-Focused Algorithms for Online Auctioning
- Competitive Analysis of the LRFU Paging Algorithm
- Admission Control to Minimize Rejections
- Session 5 - Invited Talk
- Secure Multi-party Computational Geometry
- Session 6A
- The Grid Placement Problem
- On the Reflexivity of Point Sets
- Session 6B
- A 7/8-Approximation Algorithm for Metric Max TSP
- Approximating Multi-objective Knapsack Problems
- Session 7A
- Visual Ranking of Link Structures
- A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
- Session 7B
- Short and Simple Labels for Small Distances and Other Functions
- Fast Boolean Matrix Multiplication for Highly Clustered Data
- Session 8A
- Partitioning Colored Point Sets into Monochromatic Parts
- The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
- I/O-Efficient Shortest PathQueries in Geometric Spanners
- Session 8B
- Higher-Dimensional Packing with Order Constraints
- Bin Packing with Item Fragmentation
- Practical Approximation Algorithms for Separable Packing Linear Programs
- Session 9 - Invited Talk
- The Challenges of Delivering Content on the Internet
- Session 10A
- Upward Embeddings and Orientations of Undirected Planar Graphs
- An Approach for Mixed Upward Planarization
- Session 10B
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Session 11A
- A Decomposition-Based Approach to Layered Manufacturing
- When Can You Fold a Map?
- Session 11B
- Search Trees with Relaxed Balance and Near-Optimal Height
- Succinct Dynamic Data Structures
- Session 12A
- Optimal Algorithms for Two-Guard Walkability of Simple Polygons
- Movement Planning in the Presence of Flows
- Session 12B
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- On External-Memory Planar Depth First Search.