SODA 1994 - PDF Preprint Papers

SODA 1994 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-1994 Paper

click to vote

SODA
1994
ACM

138views Algorithms» more SODA 1994»

Average Case Analysis of Dynamic Geometric Optimization

14 years 1 months ago

Download www.ics.uci.edu

We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...

David Eppstein

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	138	Average Case Analysis of Dynamic Geometric Optimization	claim
2	133	Derandomizing Algorithms for Routing and Sorting on Meshes	claim
3	105	Approximate Data Structures with Applications	claim
4	103	Fast Comparison of Evolutionary Trees	claim
5	100	Physical Mapping of Chromosomes Using Unique Probes	claim
6	97	An Effective Additive Basis for the Integers	claim
7	93	Clustering for Faster Network Simplex Pivots	claim
8	89	Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances	claim
9	88	Optimal Prediction for Prefetching in the Worst Case	claim
10	85	An Optimal Algorithm for Approximate Nearest Neighbor Searching	claim
11	81	Let Sleeping Files Lie: Pattern Matching in Z-compressed Files	claim
12	81	Approximately Counting Hamilton Cycles in Dense Graphs	claim
13	81	Spanning Trees Short or Small	claim
14	75	Online Interval Scheduling	claim
15	73	An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem	claim
16	72	Moments of Inertia and Graph Separators	claim
17	71	A Sublinear Parallel Algorithm for Stable Matching	claim
18	67	Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours	claim
19	63	Matching Nuts and Bolts	claim
20	61	Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers