140 search results - page 12 / 28 » Computing Minimum Spanning Trees with Uncertainty |
152
Voted
IPCO
2010
15 years 6 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
150
click to vote
AINA
2009
IEEE
15 years 12 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
167
click to vote
IWPEC
2009
Springer
15 years 11 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...
135
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
117
Voted
BIRTHDAY
2009
Springer
15 years 12 months ago
2009
Springer
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...