07408nam 22007815 450 991076845470332120200702000504.03-540-39658-610.1007/b13632(CKB)1000000000212194(SSID)ssj0000321192(PQKBManifestationID)11212659(PQKBTitleCode)TC0000321192(PQKBWorkID)10276824(PQKB)10924031(DE-He213)978-3-540-39658-1(MiAaPQ)EBC3087976(PPN)155174444(EXLCZ)99100000000021219420121227d2003 u| 0engurnn|008mamaatxtccrAlgorithms - ESA 2003 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings /edited by Giuseppe Di Battista, Uri Zwick1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (XIV, 790 p.) Lecture Notes in Computer Science,0302-9743 ;2832Bibliographic Level Mode of Issuance: Monograph3-540-20064-9 Includes bibliographical references at the end of each chapters and index.Invited 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.Lecture Notes in Computer Science,0302-9743 ;2832Software engineeringAlgorithmsData structures (Computer science)Computer science—MathematicsComputer graphicsSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Data Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Mathematics of Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I17001Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Software engineering.Algorithms.Data structures (Computer science).Computer science—Mathematics.Computer graphics.Software Engineering/Programming and Operating Systems.Algorithm Analysis and Problem Complexity.Data Structures.Data Structures and Information Theory.Mathematics of Computing.Computer Graphics.005.1Di Battista Giuseppeedthttp://id.loc.gov/vocabulary/relators/edtZwick Uriedthttp://id.loc.gov/vocabulary/relators/edtESA 2003MiAaPQMiAaPQMiAaPQBOOK9910768454703321Algorithms - ESA 20031930089UNINA