Optimization problems with color-induced budget constraints |
| |
Authors: | Corinna Gottschalk author-information" >,Hendrik Lüthen,Britta Peis,Andreas Wierz |
| |
Affiliation: | 1.RWTH Aachen University,Aachen,Germany;2.Siemens Corporate Technology,Munich,Germany;3.TU Darmstadt,Darmstadt,Germany |
| |
Abstract: | In 1984, Gabow and Tarjan provided a very elegant and fast algorithm for the following problem: given a matroid defined on a red and blue colored ground set, determine a basis of minimum cost among those with k red elements, or decide that no such basis exists. In this paper, we investigate extensions of this problem from ordinary matroids to the more general notion of poset matroids which take precedence constraints on the ground set into account. We show that the problem on general poset matroids becomes -hard, already if the underlying partially ordered set (poset) consists of binary trees of height two. On the positive side, we present two algorithms: a pseudopolynomial one for integer polymatroids, i.e., the case where the poset consists of disjoint chains, and a polynomial algorithm for the problem to determine a minimum cost ideal of size l with k red elements, i.e., the uniform rank-l poset matroid, on series-parallel posets. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|