16 citations · 30 across the 17 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018
Approximate Multi-Matroid Intersection via Iterative Refinement
André Linhares, Neil Olver, Chaitanya Swamy +1
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matr…
cs.DS2018
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
Neil Olver, Frans Schalekamp, Suzanne van der Ster +2
We give a 2-approximation algorithm for the Maximum Agreement Forest problem on two rooted binary trees. This NP-hard problem has been studied extensively in the past two decades,…