David Eppstein

*J. Algorithms* 17(2):237–250, Sep 1994

Tech. report 92-04, Univ. of California, Irvine, Dept. of Information and Computer Science, 1992

*Proc. 2nd Worksh. Algorithms and Data Structures (WADS 1991)*, Lecture Notes in Computer Science 519, Frank K. H. A. Dehne,
Jörg-Rudiger Sack,
and Nicola Santoro, ed., Springer-Verlag, Aug 1991, pp. 392–399

*Mathematical Reviews* 95e:68168

http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-04.pdf

http://dx.doi.org/10.1006/jagm.1994.1033

Cited by:

- How to treat delete requests in semi-online problems
- On certificates and lookahead in dynamic graph problems
- Self-adjusting $k$-ary search-trees
- Graphs, Networks, and Algorithms
- Low-cost fault-tolerant spanning graphs for point sets in the Euclidean plane
- On the approximation ratio of the MST-based heuristic for the energy-efficient Broadcast problem in static ad-hoc radio networks
- A Worst-case Analysis of a MST-based Heuristic to Construct Energy-efficient Broadcast Subtrees in Wireless Networks
- Finding the shortest bottleneck edge in a parametric minimum spanning tree