274 search results - page 10 / 55 » The Polymatroid Steiner Problems |
SODA
2008
ACM
14 years 9 days ago
2008
ACM
STOC
2010
ACM
14 years 3 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
SODA
2008
ACM
14 years 9 days ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
JUCS
2008
13 years 11 months ago
2008
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...