vix.ing · top · new · best · stats · spec

Approximating the Minimum-Degree Steiner Tree to within One of Optimal

1994/11/01 by Martin Fürer, M. Furer, Balaji Raghavachari +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Binary tree #Combinatorics #Complexity and Algorithms in Graphs #Connected dominating set #Degree (music) #Discrete mathematics #Gomory–Hu tree #Graph #K-ary tree #Mathematics #Minimum degree spanning tree #Minimum spanning tree #Spanning tree #Steiner tree problem #Tree (set theory) #Tree structure #VLSI and FPGA Design Techniques #k-minimum spanning tree

paper · doi:10.1006/jagm.1994.1042

crossref issued 1994/11/01 · crossref published 1994/11/01 · crossref published-print 1994/11/01 · openalex publication_date 1994/11/01 · crossref created 2002/09/17 · crossref deposited 2019/05/09 · openalex created_date 2025/10/10 · crossref indexed 2026/07/09 · openalex updated_date 2026/07/09

Cited by