Return to home page
Searching: Muskingum library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
Conference ESA (Symposium) (8th : 2000 : Saarbrücken, Germany)
Title Algorithms - ESA 2000 : 8th annual European symposium, Saarbrucken, Germany, September 5-8, 2000 : proceedings / Mike Paterson (ed.).
Imprint Berlin ; New York : Springer, 2000.

View online
View online
Conference ESA (Symposium) (8th : 2000 : Saarbrücken, Germany)
Series Lecture notes in computer science ; 1879.
Lecture notes in computer science ; 1879.
Subject Computer algorithms -- Congresses.
Alt Name Paterson, Michael S.
Ohio Library and Information Network.
Description 1 online resource (ix, 450 pages) : illustrations.
Bibliography Note Includes bibliographical references and index
Contents Invited Papers -- Web Information Retrieval -- an Algorithmic Perspective -- Computational Biology -- Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps.
Access Available to OhioLINK libraries
Summary This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrcken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms.
Reproduction Electronic reproduction. Columbus, OH : OhioLINK, 2008.
System Details Mode of access: World Wide Web
ISBN 354041004X (softcover : alk. paper)
9783540410041 (softcover : alk. paper)
OCLC # 644324534
Link OhioLINK electronic book center (OCoLC)180989150.
SpringerLink (OCoLC)43927870.
Additional Format ESA 2000 (2000 : SaarbrZ_cken, Germany). Algorithms - ESA 2000 : 8th annual European symposium, SaarbrZ_cken, Germany, September 5-8, 2000 : proceedings (OCoLC)44775237.

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team