Cover Image
Read Now

Algorithms and Data Structures 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings

Bibliographic Details
Other Authors: Dehne, Frank (Editor), Sack, Jörg-Rüdiger (Editor), Tamassia, Roberto (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2001, 2001
Edition:1st ed. 2001
Series:Lecture Notes in Computer Science
Subjects:
Artificial Intelligence / Data Processing
Computer Graphics
Programming Techniques
Computer Science
Numerical Analysis
Computer Programming
Algorithms
Theory Of Computation
Data Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 04386nmm a2200421 u 4500
001 EB001884427
003 EBX01000000000000001047794
005 00000000000000.0
007 cr|||||||||||||||||||||
008 191115 ||| eng
020 |a 9783540446347 
100 1 |a Dehne, Frank  |e [editor] 
245 0 0 |a Algorithms and Data Structures  |h Elektronische Ressource  |b 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings  |c edited by Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia 
250 |a 1st ed. 2001 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2001, 2001 
300 |a XII, 492 p  |b online resource 
505 0 |a 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 --  
505 0 |a 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 --  
505 0 |a 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 
653 |a Artificial intelligence / Data processing 
653 |a Computer graphics 
653 |a Programming Techniques 
653 |a Computer science 
653 |a Numerical Analysis 
653 |a Computer programming 
653 |a Computer Graphics 
653 |a Algorithms 
653 |a Numerical analysis 
653 |a Theory of Computation 
653 |a Data Science 
700 1 |a Sack, Jörg-Rüdiger  |e [editor] 
700 1 |a Tamassia, Roberto  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-44634-6 
856 4 0 |u https://doi.org/10.1007/3-540-44634-6?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.11 

Similar Items