Low-Degree Minimum Spanning Trees (1999)

Cached

Download Links

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

Active Bibliography

42 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
1 An efficient low-degree RMST algorithm for VLSI/ULSI physical design – Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xiaodong Hu, Guiying Yan - 2004
14 Edge-Sets: An Effective Evolutionary Coding of Spanning Trees – Günther R. Raidl, Bryant A. Julstrom - 2002
24 An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem – Günther R. Raidl - 2000
18 A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem – Günther R. Raidl - 2000
2 Minimum steiner tree construction – Gabriel Robins, Er Zelikovsky - 2009
10 Geometric Interconnection and Placement Algorithms – Joseph Lavinus Ganley - 1995
3 An Architecture-Independent Unified Approach to FPGA Routing – Michael J. Alexander, Gabriel Robins - 1993
11 Dynamically-Wiresized Elmore-Based Routing Constructions – Todd D. Hodes, Bernard A. Mccoy, Gabriel Robins - 1994
31 Low Degree Spanning Trees Of Small Weight – Samir Khuller, Balaji Raghavachari, Neal Young - 1996
23 Efficient steiner tree construction based on spanning graphs – Hai Zhou - 2004
2 Approximation Algorithms for Minimum-cost Low-degree Subgraphs – Jochen Könemann - 2003
ABOUT THIS CHAPTER – Tung-chieh Chen, Yao-wen Chang
1 Optimization and Reconstruction over Graphs – Samantha J. Riesenfeld - 2008
31 Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems – S. S. Ravi, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi, Harry B. Hunt, III - 2001
1 Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits – Seth Pettie
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
3 The Diameter of the Minimum Spanning Tree of a Complete Graph – Louigi Addario-berry, Nicolas Broutin, Bruce Reed