Sciweavers

140 search results - page 12 / 28
» Computing Minimum Spanning Trees with Uncertainty
Sort
View
IPCO
2010
184views Optimization» more  IPCO 2010»
15 years 1 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
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...
Takuro Fukunaga
AINA
2009
IEEE
15 years 6 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...
IWPEC
2009
Springer
15 years 6 months ago
On the Directed Degree-Preserving Spanning Tree Problem
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...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
15 years 5 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
BIRTHDAY
2009
Springer
15 years 6 months ago
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
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...
Michiel H. M. Smid