Online submodular maximization: beating 1/2 made simple

DOI10.1007/978-3-030-17953-3_8MaRDI QIDQ6830360zbMATH OpenFDO

Authors Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg

Publication date 6 February 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-17953-3_8

zbMATH Keywords

greedy algorithmssubmodular optimizationonline auctions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cited in

(1)

• Robust algorithms for online k-means clustering

This page was built for publication: Online submodular maximization: beating 1/2 made simple

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830360)