A Parameterized View on Matroid Optimization Problems

Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid problems, such as 3-matroid intersection, are NP-hard. Here we investigate these problems from the parameterized complexity point of view: instead of the trivial nO(k) time brute force algorithm for finding a k-element solution, we try to give algorithms with uniformly polynomial (i.e., f(k)

• Type: Conference
• Year: 2006
• Where: ACID
• Authors: Dániel Marx
• Keywords: ACID 2006, Algorithms, Combinatorial Optimization Problems, Matroid, Natural Matroid Problems