AbstractWe give a complete proof that in any finite-dimensional normed linear space a finite set of points has a minimal spanning tree in which the maximum degree is bounded above by the strict Hadwiger number of the unit ball, i.e., the largest number of unit vectors such that the distance between any two is larger than 1
We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees (SMTs) ...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
Given n points in the plane, the degree-K spanning tree problem asks for a spanning tree of minimum ...
We give a complete proof that in any finite-dimensional normed linear space a finite set of points h...
AbstractWe give a complete proof that in any finite-dimensional normed linear space a finite set of ...
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum sp...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
We survey problems and results from combinatorial geometry in normed spaces, concentrating on proble...
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum ...
© 2019 Dr Patrick AndersenWe introduce the geometric $\delta$-minimum bottleneck spanning tree probl...
In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1...
Given a compact E⊂Rn and s>0, the maximum distance problem seeks a compact and connected subset o...
Abstract. The problem of finding a minimum spanning tree connecting n points in a k-dimensional spac...
We develop a general method for proving that certain star configurations in finite-dimensional norme...
Abstract. The problem of finding a minimum spaYlning tree connecting n points in a k-dimensional spa...
We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees (SMTs) ...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
Given n points in the plane, the degree-K spanning tree problem asks for a spanning tree of minimum ...
We give a complete proof that in any finite-dimensional normed linear space a finite set of points h...
AbstractWe give a complete proof that in any finite-dimensional normed linear space a finite set of ...
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum sp...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
We survey problems and results from combinatorial geometry in normed spaces, concentrating on proble...
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum ...
© 2019 Dr Patrick AndersenWe introduce the geometric $\delta$-minimum bottleneck spanning tree probl...
In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1...
Given a compact E⊂Rn and s>0, the maximum distance problem seeks a compact and connected subset o...
Abstract. The problem of finding a minimum spanning tree connecting n points in a k-dimensional spac...
We develop a general method for proving that certain star configurations in finite-dimensional norme...
Abstract. The problem of finding a minimum spaYlning tree connecting n points in a k-dimensional spa...
We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees (SMTs) ...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
Given n points in the plane, the degree-K spanning tree problem asks for a spanning tree of minimum ...
DOI
Add to ORKG