2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Robust Sparsification for Matroid Intersection with Applications
Chien-Chung Huang, François Sellier
Matroid intersection is a classical optimization problem where, given two matroids over the same ground set, the goal is to find the largest common independent set. In this paper,…
cs.DS2023★ 2 cited
Matroid-Constrained Vertex Cover
Chien-Chung Huang, François Sellier
In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose…