default search action
BibTeX record conf/approx/MoseleyS19
@inproceedings{DBLP:conf/approx/MoseleyS19, author = {Benjamin Moseley and Maxim Sviridenko}, editor = {Dimitris Achlioptas and L{\'{a}}szl{\'{o}} A. V{\'{e}}gh}, title = {Submodular Optimization with Contention Resolution Extensions}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, {USA}}, series = {LIPIcs}, volume = {145}, pages = {3:1--3:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.3}, doi = {10.4230/LIPICS.APPROX-RANDOM.2019.3}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/MoseleyS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.