# Reducing the rank of a matroid

Abstract : We consider the rank reduction problem for matroids: Given a matroid $M$ and an integer $k$, find a minimum size subset of elements of $M$ whose removal reduces the rank of $M$ by at least $k$. When $M$ is a graphical matroid this problem is the minimum $k$-cut problem, which admits a 2-approximation algorithm. In this paper we show that the rank reduction problem for transversal matroids is essentially at least as hard to approximate as the densest $k$-subgraph problem. We also prove that, while the problem is easily solvable in polynomial time for partition matroids, it is NP-hard when considering the intersection of two partition matroids. Our proof shows, in particular, that the maximum vertex cover problem is NP-hard on bipartite graphs, which answers an open problem of B. Simeone.
Keywords :
Document type :
Journal articles

Cited literature [20 references]

https://hal.inria.fr/hal-01349050
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, July 26, 2016 - 5:30:56 PM
Last modification on : Thursday, June 18, 2020 - 12:32:05 PM

### File

2334-9777-1-PB.pdf
Explicit agreement for this submission

### Identifiers

• HAL Id : hal-01349050, version 1

### Citation

Gwenaël Joret, Adrian Vetta. Reducing the rank of a matroid. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, Vol. 17 no.2 (2), pp.143-156. ⟨hal-01349050⟩

Record views