An Efficient Reduction of a Gammoid to a Partition Matroid

07/08/2021
by   Marilena Leichter, et al.
0

Our main contribution is a polynomial-time algorithm to reduce a k-colorable gammoid to a (2k-2)-colorable partition matroid. It is known that there are gammoids that can not be reduced to any (2k-3)-colorable partition matroid, so this result is tight. We then discuss how such a reduction can be used to obtain polynomial-time algorithms with better approximation ratios for various natural problems related to coloring and list coloring the intersection of matroids.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset