Australasia's Biggest Online Store

We won't be beaten by anyone. Guaranteed

Algorithms - ESA 2000
By

Rating
Product Description
Product Details

Promotional Information

Springer Book Archives

Table of 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.

Ask a Question About this Product More...
Write your question below:
Look for similar items by category
People also searched for
How Fishpond Works
Fishpond works with suppliers all over the world to bring you a huge selection of products, really great prices, and delivery included on over 25 million products that we sell. We do our best every day to make Fishpond an awesome place for customers to shop and get what they want — all at the best prices online.
Webmasters, Bloggers & Website Owners
You can earn a 5% commission by selling Algorithms - ESA 2000: 8th Annual European Symposium Saarbrucken, Germany, September 5-8, 2000 Proceedings (Lecture Notes in Computer Science) on your website. It's easy to get started - we will give you example code. After you're set-up, your website can earn you money while you work, play or even sleep! You should start right now!
Authors / Publishers
Are you the Author or Publisher of a book? Or the manufacturer of one of the millions of products that we sell. You can improve sales and grow your revenue by submitting additional information on this title. The better the information we have about a product, the more we will sell!
Back to top