Abstract
AbstractGiven two matroids $$\mathcal {M}_{1} = (E, \mathcal {B}_{1})$$
M
1
=
(
E
,
B
1
)
and $$\mathcal {M}_{2} = (E, \mathcal {B}_{2})$$
M
2
=
(
E
,
B
2
)
on a common ground set E with base sets $$\mathcal {B}_1$$
B
1
and $$\mathcal {B}_2$$
B
2
, some integer $$k \in \mathbb {N}$$
k
∈
N
, and two cost functions $$c_{1}, c_{2} :E \rightarrow \mathbb {R}$$
c
1
,
c
2
:
E
→
R
, we consider the optimization problem to find a basis $$X \in \mathcal {B}_{1}$$
X
∈
B
1
and a basis $$Y \in \mathcal {B}_{2}$$
Y
∈
B
2
minimizing the cost $$\sum _{e\in X} c_1(e)+\sum _{e\in Y} c_2(e)$$
∑
e
∈
X
c
1
(
e
)
+
∑
e
∈
Y
c
2
(
e
)
subject to either a lower bound constraint $$|X \cap Y| \le k$$
|
X
∩
Y
|
≤
k
, an upper bound constraint $$|X \cap Y| \ge k$$
|
X
∩
Y
|
≥
k
, or an equality constraint $$|X \cap Y| = k$$
|
X
∩
Y
|
=
k
on the size of the intersection of the two bases X and Y. The problem with lower bound constraint turns out to be a generalization of the Recoverable Robust Matroid problem under interval uncertainty representation for which the question for a strongly polynomial-time algorithm was left as an open question in Hradovich et al. (J Comb Optim 34(2):554–573, 2017). We show that the two problems with lower and upper bound constraints on the size of the intersection can be reduced to weighted matroid intersection, and thus be solved with a strongly polynomial-time primal-dual algorithm. We also present a strongly polynomial, primal-dual algorithm that computes a minimum cost solution for every feasible size of the intersection k in one run with asymptotic running time equal to one run of Frank’s matroid intersection algorithm. Additionally, we discuss generalizations of the problems from matroids to polymatroids, and from two to three or more matroids. We obtain a strongly polynomial time algorithm for the recoverable robust polymatroid base problem with interval uncertainties.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference18 articles.
1. Büsing, C.: Recoverable Robustness in Combinatorial Optimization. Cuvillier Verlag, New York (2011)
2. Chassein, A., Goerigk, M.: On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discrete Appl. Math. 3, 76109 (2020)
3. Cunningham, W.H., Geelen, J.F.: The optimal path-matching problem. Combinatorica 17(3), 315–337 (1997)
4. Edmonds, J.: Submodular functions, matroids and certain polyhedra, combinatorial structures and their applications (R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds.). Gordon and Breach pp. 69–87 (1970)
5. Frank, A.: A weighted matroid intersection algorithm. J. Algorithms 2(4), 328–336 (1981)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Robust Spanning Tree Problems;International Series in Operations Research & Management Science;2024