Matroid Bases with Cardinality Constraints on the Intersection

07/10/2019
by   Stefan Lendl, et al.
0

Given two matroids M_1 = (E, B_1) and M_2 = (E, B_2) on a common ground set E with base sets B_1 and B_2, some integer k ∈N, and two cost functions c_1, c_2 E →R, we consider the optimization problem to find a basis X ∈B_1 and a basis Y ∈B_2 minimizing cost ∑_e∈ X c_1(e)+∑_e∈ Y c_2(e) subject to either a lower bound constraint |X ∩ Y| < k, an upper bound constraint |X ∩ Y| > k, or an equality constraint |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 by Hradovich et al. 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. The question whether the problem with equality constraint can also be solved efficiently turned out to be a lot harder. As our main result, we present a strongly-polynomial, primal-dual algorithm for the problem with equality constraint on the size of the intersection. Additionally, we discuss generalizations of the problems from matroids to polymatroids, and from two to three or more matroids.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/05/2020

Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications

For two matroids M_1 and M_2 with the same ground set V and two cost fun...
research
01/08/2021

Nonlinear Optimization in R using nlopt

In this article, we present a problem of nonlinear constraint optimizati...
research
09/17/2019

Reachability Games with Relaxed Energy Constraints

We study games with reachability objectives under energy constraints. We...
research
04/10/2022

EPTAS for the dual of splittable bin packing with cardinality constraint

The problem considered is the splittable bin packing with cardinality co...
research
02/11/2023

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection

We study the budgeted versions of the well known matching and matroid in...
research
07/09/2023

Budgeted Matroid Maximization: a Parameterized Viewpoint

We study budgeted variants of well known maximization problems with mult...
research
08/19/2016

Critical Points for Two-view Triangulation

Two-view triangulation is a problem of minimizing a quadratic polynomial...

Please sign up or login with your details

Forgot password? Click here to reset