Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios

Ahmad Biniaz

Type: Preprint

Publication Date: 2019-11-19

Citations: 0

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios	2019	Ahmad Biniaz
+ PDF Chat	Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios	2019	Ahmad Biniaz
+ PDF Chat	Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios	2021	Ahmad Biniaz
+ PDF Chat	Degree bounded bottleneck spanning trees in three dimensions	2019	Patrick Andersen Charl Ras
+	Degree Bounded Bottleneck Spanning Trees in Three Dimensions	2018	Patrick Andersen Charl Ras
+	Degree Bounded Bottleneck Spanning Trees in Three Dimensions	2018	Patrick Andersen Charl Ras
+	Euclidean bounded-degree spanning tree ratios	2003	Timothy M. Chan
+	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable	2024	Sayan Bandyapadhyay William Lochet Daniel Lokshtanov Saket Saurabh Jie Xue
+	Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable	2023	Sayan Bandyapadhyay William Lochet Daniel Lokshtanov Saket Saurabh Jie Xue
+	Average distance, minimum degree, and spanning trees	2000	Peter Dankelmann R. C. Entringer
+	Approximating bottleneck spanning trees on partitioned tuples of points	2021	Ahmad Biniaz Anil Maheshwari Michiel Smid
+	Approximating bottleneck spanning trees on partitioned tuples of points	2021	Ahmad Biniaz Anil Maheshwari Michiel Smid
+	On the Spanning and Routing Ratio of Directed Theta-Four	2018	Prosenjit Bose Jean-Lou De Carufel Darryl Hill Michiel Smid
+	Exact algorithm for the bottleneck 2-connected $k$-Steiner network problem	2011	Marcus Brazil Charl Ras D. A. Thomas
+ PDF Chat	Algorithms for Euclidean Degree Bounded Spanning Tree Problems	2019	Patrick Andersen Charl Ras
+ PDF Chat	A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks	2012	Omer Angel Abraham D. Flaxman David B. Wilson
+ PDF Chat	On minimum spanning trees for random Euclidean bipartite graphs	2023	Mario Correddu Dario Trevisan
+	Spanning tree with lower bound on the degrees	2017	Zoltán Király
+	An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem	2010	A. Karim Abu-Affash
+ PDF Chat	A Note on Approximation of Spanning Tree Congestion	2024	Petr Kolman

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (8)

Action	Title	Year	Authors
+ PDF Chat	Approximating the bottleneck plane perfect matching of a point set	2015	A. Karim Abu-Affash Ahmad Biniaz Paz Carmi Anil Maheshwari Michiel Smid
+	The square of every two-connected graph is Hamiltonian	1974	Herbert Fleischner
+	Graphs with 1-Hamiltonian-connected cubes	1973	Linda Lesniak
+	Introduction to Algorithms	1991	V. J. Rayward‐Smith Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest
+	Algorithms for Euclidean Degree Bounded Spanning Tree Problems	2018	Patrick Andersen Charl Ras
+	Degree Bounded Bottleneck Spanning Trees in Three Dimensions	2018	Patrick Andersen Charl Ras
+ PDF Chat	Low-Degree Spanning Trees of Small Weight	1996	Samir Khuller Balaji Raghavachari Neal E. Young
+ PDF Chat	On Improved Bounds for Bounded Degree Spanning Trees for Points in Arbitrary Dimension	2014	Samuel Zbarsky