Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint

Open Webpage

Kaito Fujii

Published: 2016, Last Modified: 14 May 2025Inf. Process. Lett. 2016EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Two algorithms for maximizing a monotone submodular function under a constraint.•One is a 1/4-approximation algorithm that is faster than the greedy algorithm.•The other is a faster variant of the local search algorithm.