LEADER 06213nam 22008175 450 001 996465804103316 005 20200706081001.0 010 $a3-540-44634-6 024 7 $a10.1007/3-540-44634-6 035 $a(CKB)1000000000211534 035 $a(SSID)ssj0000321214 035 $a(PQKBManifestationID)11212662 035 $a(PQKBTitleCode)TC0000321214 035 $a(PQKBWorkID)10263832 035 $a(PQKB)11048308 035 $a(DE-He213)978-3-540-44634-7 035 $a(MiAaPQ)EBC3072887 035 $a(PPN)155230840 035 $a(EXLCZ)991000000000211534 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures$b[electronic resource] $e7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings /$fedited by Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 492 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2125 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42423-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aSession 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 Path Queries 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2125 606 $aComputer programming 606 $aComputers 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aNumerical analysis 606 $aComputer graphics 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputer programming. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aNumeric Computing. 615 24$aComputer Graphics. 676 $a005.1 702 $aDehne$b Frank$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSack$b Jörg-Rüdiger$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTamassia$b Roberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWADS 2001 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465804103316 996 $aAlgorithms and Data Structures$9772001 997 $aUNISA