A Note on Robust Subsets of Transversal Matroids

10/18/2022
by   Naoyuki Kamiyama, et al.
0

Robust subsets of matroids were introduced by Huang and Sellier to propose approximate kernels for the matroid-constrained maximum vertex cover problem. In this paper, we prove that the bound for robust subsets of transversal matroids given by Huang and Sellier can be improved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2019

Hierarchical b-Matching

A matching of a graph is a subset of edges no two of which share a commo...
research
08/21/2020

Optimal algorithm for computing Steiner 3-eccentricities of trees

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...
research
03/05/2023

Union vertex-distinguishing edge colorings

The union vertex-distinguishing chromatic index χ'_∪(G) of a graph G is ...
research
05/17/2020

Robust subset selection

The best subset selection (or "best subsets") estimator is a classic too...
research
07/18/2019

On the AC^0[⊕] complexity of Andreev's Problem

Andreev's Problem states the following: Given an integer d and a subset ...
research
12/12/2018

An Improved Scheme in the Two Query Adaptive Bitprobe Model

In this paper, we look into the adaptive bitprobe model that stores subs...
research
09/04/2019

A greedoid and a matroid inspired by Bhargava's p-orderings

Consider a finite set E equipped with a "weight function" w : E →R and a...

Please sign up or login with your details

Forgot password? Click here to reset