Low-Degree Minimum Spanning Trees (1999)

Cached

Download Links

by Gabriel Robins , Jeffrey S. Salowe
Venue:Discrete Comput. Geom
Citations:21 - 1 self

Active Bibliography

43 Closing the Gap: Near-Optimal Steiner Trees in Polynomial Time – Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang - 1994
On the Maximum Degree of Minimum Spanning Trees (Extended Abstract) – Gabriel Robins, Jeffrey S. Salowe - 1994
Closing the Gap: Near-Optimal Steiner Trees in Polynomial Time – Tim Barrera, Tim Barrera, Jeff Griffith, Jeff Griffith, Gabriel Robins, Gabriel Robins, Tongtong Zhang, Tongtong Zhang
IEEL TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 13, NO 11. NOVEMBER 1994 Closing the Gap: Near-Optimal Steiner Trees in Polynomial Time – Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang
572 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
655 Approximating discrete probability distributions with dependence trees – C. I<. Chow, Sexior Member, C. N. Liu - 1968
1376 RADAR: an in-building RF-based user location and tracking system – Paramvir Bahl, Venkata N. Padmanabhan - 2000
968 Fast Planning Through Planning Graph Analysis – Avrim L. Blum, Merrick L. Furst - 1995
579 Dynamic Bayesian Networks: Representation, Inference and Learning – Kevin Patrick Murphy - 2002