274 search results - page 1 / 55 » The Polymatroid Steiner Problems |
90
Voted
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
COMBINATORICS
2000
14 years 9 months ago
2000
We consider the problem of determining when two delta-matroids on the same ground-set have a common base. Our approach is to adapt the theory of matchings in 2-polymatroids develo...
68
Voted
ORL
2006
14 years 9 months ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
IPCO
2007
14 years 11 months ago
2007
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
ORL
2008
14 years 9 months ago
2008
We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...