Add to ORKGGiven a complete graph on n nodes with metric edge costs, the minimum-cost khop spanning tree (kHMST) problem asks for a spanning tree of minimum total cost such that the longest root-leaf-path in the tree has at most k edges. We present an algorithm that computes such a tree of total expected cost O(log n) times that of a minimum-cost k-hop spanning-tree
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
[[abstract]]Both the building cost and the multiple-source routing cost are important considerations...
Let G = (V, E) be an undirected connected graph with a cost function w mapping edges to positive rea...
Given a complete graph on n nodes with metric edge costs, the minimum-cost k-hop spanning tree (kHMS...
http://www.sciencedirect.comGiven a complete graph on~n nodes with metric edge costs, the minimum-co...
In this paper we consider the problem of computing minimum-cost spanning trees with depth restrictio...
In this paper we consider the problem of computing minimum-cost spanning trees with depth restrictio...
In this paper we consider the problem of computing minimum-cost spanning trees with depth restricti...
Given an undirected graph with non-negative edge costs and an integer k, the k-MST problem is that ...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
AbstractGiven an undirected graph with nonnegative edge costs and an integerk, thek-MST problem is t...
International audienceWe consider the problem of computing a Steiner tree of minimum cost under a ho...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
[[abstract]]Both the building cost and the multiple-source routing cost are important considerations...
Let G = (V, E) be an undirected connected graph with a cost function w mapping edges to positive rea...
Given a complete graph on n nodes with metric edge costs, the minimum-cost k-hop spanning tree (kHMS...
http://www.sciencedirect.comGiven a complete graph on~n nodes with metric edge costs, the minimum-co...
In this paper we consider the problem of computing minimum-cost spanning trees with depth restrictio...
In this paper we consider the problem of computing minimum-cost spanning trees with depth restrictio...
In this paper we consider the problem of computing minimum-cost spanning trees with depth restricti...
Given an undirected graph with non-negative edge costs and an integer k, the k-MST problem is that ...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Abstract. In this paper, we study the minimum degree minimum span-ning tree problem: Given a graph G...
: We consider the problem of constructing a spanning tree for a graph G = (V, E) with n vertices an...
The minimal spanning tree problem is one of the oldest and most basic graph problems in theoretical ...
AbstractGiven an undirected graph with nonnegative edge costs and an integerk, thek-MST problem is t...
International audienceWe consider the problem of computing a Steiner tree of minimum cost under a ho...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
[[abstract]]Both the building cost and the multiple-source routing cost are important considerations...
Let G = (V, E) be an undirected connected graph with a cost function w mapping edges to positive rea...