Work

Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid

Year: 2018

Type: preprint

Abstract: We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1807.05532

Authors: Buchbinder, Niv, Feldman, Moran, Garg, Mohit

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2951569895

Cites: 14

Cited by: 3

Related to: 20