396 search results - page 26 / 80 » An Optimal Minimum Spanning Tree Algorithm |
ORL
2008
15 years 9 days ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
118
click to vote
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
115
click to vote
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
ALENEX
2001
15 years 1 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
108
Voted
WINET
2010
14 years 10 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...