PublicationsPapers

Online submodular maximization: beating 1/2 made simple

Niv Buchbinder, Moran Feldman, Yuval Filmus and Mohit Garg
IPCO 2019, Math Prog

We analyze random order greedy, showing that its approximation ratio is at least 0.5096 for any number of parts.

BibTeX

@inproceedings{BFFG2019,
 title = {Online submodular maximization: beating 1/2 made simple},
 author = {Niv Buchbinder and Moran Feldman and Yuval Filmus and Mohit Garg},
 booktitle = {20th Conference on Integer Programming and Combinatorial Optimization (IPCO'19)},
 year = {2019}
}

@journal{BFFG2020,
 title = {Online submodular maximization: beating 1/2 made simple},
 author = {Niv Buchbinder and Moran Feldman and Yuval Filmus and Mohit Garg},
 journal = {Mathematical Programming},
 volume = {183},
 pages = {149--169},
 year = {2020}
}
copy to clipboard