Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning any k points. The problem is NP-hard and we give an O(logk)-approximation algorithm
We study the following maximization problem in the Euclidean plane: Given a collection of neighborho...
Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex ...
Given a complete graph on n nodes with metric edge costs, the minimum-cost khop spanning tree (kHMST...
Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning ...
Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning ...
Abstract. The problem of finding a minimum spanning tree connecting n points in a k-dimensional spac...
In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning...
Abstract. The problem of finding a minimum spaYlning tree connecting n points in a k-dimensional spa...
[[abstract]]In this paper, we consider the following problem. Preprocess n moving points in the plan...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
[[abstract]]We shall present a divide-and-conquer algorithm to construct minimal spanning trees out ...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approx...
AbstractWe give fast new approximation algorithms for the problem of choosing k planar points out of...
We study the following maximization problem in the Euclidean plane: Given a collection of neighborho...
Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex ...
Given a complete graph on n nodes with metric edge costs, the minimum-cost khop spanning tree (kHMST...
Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning ...
Given n points in the Euclidean plane, we consider the problem of finding the minimum tree spanning ...
Abstract. The problem of finding a minimum spanning tree connecting n points in a k-dimensional spac...
In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning...
Abstract. The problem of finding a minimum spaYlning tree connecting n points in a k-dimensional spa...
[[abstract]]In this paper, we consider the following problem. Preprocess n moving points in the plan...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approxi...
[[abstract]]We shall present a divide-and-conquer algorithm to construct minimal spanning trees out ...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
The preoblem of finding a spanning tree with maximum number of leaves is studied. A simple 2-approx...
AbstractWe give fast new approximation algorithms for the problem of choosing k planar points out of...
We study the following maximization problem in the Euclidean plane: Given a collection of neighborho...
Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex ...
Given a complete graph on n nodes with metric edge costs, the minimum-cost khop spanning tree (kHMST...
DOI
Add to ORKG