326 search results - page 8 / 66 » The Minimum-Area Spanning Tree Problem |
CPC
2007
13 years 8 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
EOR
2008
13 years 8 months ago
2008
We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We dene them as the weighted Shapley values of the optimistic game v+ introduced in Berganti
DAM
2000
13 years 8 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
COR
2008
13 years 8 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
PPSN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...