Add to ORKG© 2019 Dr Patrick AndersenWe introduce the geometric $\delta$-minimum bottleneck spanning tree problem ($\delta$-MBST), which is the problem of finding a spanning tree for a set of points in a geometric space (e.g., the Euclidean plane) such that no vertex in the tree has a degree that exceeds $\delta$, and the length of the longest edge in the tree is minimum. We give complexity results for this problem and describe several approximation algorithms whose performances we investigate, both analytically and through computational experimentation
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum ...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...
Let G = (V, E) be an undirected connected graph with a cost function w mapping edges to positive rea...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
Abstract. In this paper we consider bi-criteria geometric optimization problems, in particular, the ...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Every pair of points lying on a polygonal path P in the plane has a detour associated with it, which...
This paper presents two algorithms to construct minimum weight spanning trees with approximately mi...
In this paper, we present a new bicriteria approximation algorithm for the degreebounded minimum spa...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum ...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...
Let G = (V, E) be an undirected connected graph with a cost function w mapping edges to positive rea...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
Abstract. In this paper we consider bi-criteria geometric optimization problems, in particular, the ...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vert...
Every pair of points lying on a polygonal path P in the plane has a detour associated with it, which...
This paper presents two algorithms to construct minimum weight spanning trees with approximately mi...
In this paper, we present a new bicriteria approximation algorithm for the degreebounded minimum spa...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater th...
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum ...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...