06213nam 22008175 450 99646580410331620200706081001.03-540-44634-610.1007/3-540-44634-6(CKB)1000000000211534(SSID)ssj0000321214(PQKBManifestationID)11212662(PQKBTitleCode)TC0000321214(PQKBWorkID)10263832(PQKB)11048308(DE-He213)978-3-540-44634-7(MiAaPQ)EBC3072887(PPN)155230840(EXLCZ)99100000000021153420121227d2001 u| 0engurnn#008mamaatxtccrAlgorithms and Data Structures[electronic resource] 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings /edited by Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (XII, 492 p.)Lecture Notes in Computer Science,0302-9743 ;2125Bibliographic Level Mode of Issuance: Monograph3-540-42423-7 Includes bibliographical references at the end of each chapters and index.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 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.Lecture Notes in Computer Science,0302-9743 ;2125Computer programmingComputersAlgorithmsData structures (Computer science)Numerical analysisComputer graphicsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XComputer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Computer programming.Computers.Algorithms.Data structures (Computer science).Numerical analysis.Computer graphics.Programming Techniques.Theory of Computation.Algorithm Analysis and Problem Complexity.Data Structures.Numeric Computing.Computer Graphics.005.1Dehne Frankedthttp://id.loc.gov/vocabulary/relators/edtSack Jörg-Rüdigeredthttp://id.loc.gov/vocabulary/relators/edtTamassia Robertoedthttp://id.loc.gov/vocabulary/relators/edtWADS 2001MiAaPQMiAaPQMiAaPQBOOK996465804103316Algorithms and Data Structures772001UNISA