LEADER 07408nam 22007815 450 001 9910768454703321 005 20200702000504.0 010 $a3-540-39658-6 024 7 $a10.1007/b13632 035 $a(CKB)1000000000212194 035 $a(SSID)ssj0000321192 035 $a(PQKBManifestationID)11212659 035 $a(PQKBTitleCode)TC0000321192 035 $a(PQKBWorkID)10276824 035 $a(PQKB)10924031 035 $a(DE-He213)978-3-540-39658-1 035 $a(MiAaPQ)EBC3087976 035 $a(PPN)155174444 035 $a(EXLCZ)991000000000212194 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms - ESA 2003 $e11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings /$fedited by Giuseppe Di Battista, Uri Zwick 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XIV, 790 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2832 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20064-9 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lectures -- Sublinear Computing -- Authenticated Data Structures -- Approximation Algorithms and Network Games -- Contributed Papers: Design and Analysis Track -- I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries -- Line System Design and a Generalized Coloring Problem -- Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties -- Scheduling for Flow-Time with Admission Control -- On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows -- Semi-clairvoyant Scheduling -- Algorithms for Graph Rigidity and Scene Analysis -- Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting -- Multi-player and Multi-round Auctions with Severely Bounded Communication -- Network Lifetime and Power Assignment in ad hoc Wireless Networks -- Disjoint Unit Spheres admit at Most Two Line Transversals -- An Optimal Algorithm for the Maximum-Density Segment Problem -- Estimating Dominance Norms of Multiple Data Streams -- Smoothed Motion Complexity -- Kinetic Dictionaries: How to Shoot a Moving Target -- Deterministic Rendezvous in Graphs -- Fast Integer Programming in Fixed Dimension -- Correlation Clustering ? Minimizing Disagreements on Arbitrary Weighted Graphs -- Dominating Sets and Local Treewidth -- Approximating Energy Efficient Paths in Wireless Multi-hop Networks -- Bandwidth Maximization in Multicasting -- Optimal Distance Labeling for Interval and Circular-Arc Graphs -- Improved Approximation of the Stable Marriage Problem -- Fast Algorithms for Computing the Smallest k-Enclosing Disc -- The Minimum Generalized Vertex Cover Problem -- An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint -- On-Demand Broadcasting Under Deadline -- Improved Bounds for Finger Search on a RAM -- The Voronoi Diagram of Planar Convex Objects -- Buffer Overflows of Merging Streams -- Improved Competitive Guarantees for QoS Buffering -- On Generalized Gossiping and Broadcasting -- Approximating the Achromatic Number Problem on Bipartite Graphs -- Adversary Immune Leader Election in ad hoc Radio Networks -- Universal Facility Location -- A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm -- I/O-Efficient Undirected Shortest Paths -- On the Complexity of Approximating TSP with Neighborhoods and Related Problems -- A Lower Bound for Cake Cutting -- Ray Shooting and Stone Throwing -- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs -- Binary Space Partition for Orthogonal Fat Rectangles -- Sequencing by Hybridization in Few Rounds -- Efficient Algorithms for the Ring Loading Problem with Demand Splitting -- Seventeen Lines and One-Hundred-and-One Points -- Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves -- Contributed Papers: Engineering and Application Track -- Streaming Geometric Optimization Using Graphics Hardware -- An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals -- Experiments on Graph Clustering Algorithms -- More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling -- The Minimum Shift Design Problem: Theory and Practice -- Loglog Counting of Large Cardinalities -- Packing a Trunk -- Fast Smallest-Enclosing-Ball Computation in High Dimensions -- Automated Generation of Search Tree Algorithms for Graph Modification Problems -- Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation -- Fleet Assignment with Connection Dependent Ground Times -- A Practical Minimum Spanning Tree Algorithm Using the Cycle Property -- The Fractional Prize-Collecting Steiner Tree Problem on Trees -- Algorithms and Experiments for the Webgraph -- Finding Short Integral Cycle Bases for Cyclic Timetabling -- Slack Optimization of Timing-Critical Nets -- Multisampling: A New Approach to Uniform Sampling and Approximate Counting -- Multicommodity Flow Approximation Used for Exact Graph Partitioning -- A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs -- Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2832 606 $aSoftware engineering 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 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 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aData Structures and Information Theory. 615 24$aMathematics of Computing. 615 24$aComputer Graphics. 676 $a005.1 702 $aDi Battista$b Giuseppe$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZwick$b Uri$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aESA 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768454703321 996 $aAlgorithms - ESA 2003$91930089 997 $aUNINA