eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2019-07-04
54:1
54:14
10.4230/LIPIcs.ICALP.2019.54
article
Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint
Ene, Alina
1
Nguyen, Huy L.
2
Department of Computer Science, Boston University, MA, USA
College of Computer and Information Science, Northeastern University, Boston, MA, USA
We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important matroids. We develop a new algorithm for a general matroid constraint with a 1 - 1/e - epsilon approximation that achieves a fast running time provided we have a fast data structure for maintaining an approximately maximum weight base in the matroid through a sequence of decrease weight operations. We construct such data structures for graphic matroids and partition matroids, and we obtain the first algorithms for these classes of matroids that achieve a nearly-optimal, 1 - 1/e - epsilon approximation, using a nearly-linear number of function evaluations and arithmetic operations.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol132-icalp2019/LIPIcs.ICALP.2019.54/LIPIcs.ICALP.2019.54.pdf
submodular maximization
matroid constraints
fast running times