AbstractIn their seminal paper on geometric minimum spanning trees, Monma and Suri (1992) [31] showed how to embed any tree of maximum degree 5 as a minimum spanning tree in the Euclidean plane. The embeddings provided by their algorithm require area O(2n2)×O(2n2) and the authors conjectured that an improvement below cn×cn is not possible, for some constant c>0. In this paper, we show how to construct MST embeddings of arbitrary trees of maximum degree 3 and 4 within polynomial area
AbstractWe study the approximability of some problems which aim at finding spanning trees in undirec...
We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approx...
A Steiner Minimal Tree (SMT) for a given set P of points is a shortest network interconnecting the p...
In their seminal paper on geometric minimum spanning trees, Monma and Suri [6] gave a method to embe...
AbstractIn their seminal paper on geometric minimum spanning trees, Monma and Suri (1992) [31] showe...
In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
AbstractMotivated by optimization problems in sensor coverage, we formulate and study the Minimum-Ar...
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum sp...
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spann...
Given a graph with n vertices, k terminals and positive integer weights not larger than c, we comput...
Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is...
We study optimization problems for the Euclidean minimum spanning tree (MST) on im-precise data. To ...
The minimum spanning tree problem with an added constraint that no node in the spanning tree has the...
In this lecture we continue the proof of the approximation guarantee given by local search for the m...
AbstractWe study the approximability of some problems which aim at finding spanning trees in undirec...
We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approx...
A Steiner Minimal Tree (SMT) for a given set P of points is a shortest network interconnecting the p...
In their seminal paper on geometric minimum spanning trees, Monma and Suri [6] gave a method to embe...
AbstractIn their seminal paper on geometric minimum spanning trees, Monma and Suri (1992) [31] showe...
In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
AbstractMotivated by optimization problems in sensor coverage, we formulate and study the Minimum-Ar...
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum sp...
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spann...
Given a graph with n vertices, k terminals and positive integer weights not larger than c, we comput...
Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is...
We study optimization problems for the Euclidean minimum spanning tree (MST) on im-precise data. To ...
The minimum spanning tree problem with an added constraint that no node in the spanning tree has the...
In this lecture we continue the proof of the approximation guarantee given by local search for the m...
AbstractWe study the approximability of some problems which aim at finding spanning trees in undirec...
We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approx...
A Steiner Minimal Tree (SMT) for a given set P of points is a shortest network interconnecting the p...
DOI
Add to ORKG