Go to the corresponding LIPIcs Volume Portal 
Liberty, Edo ; Sviridenko, Maxim
pdfformat: 

@InProceedings{liberty_et_al:LIPIcs:2017:7568, author = {Edo Liberty and Maxim Sviridenko}, title = {{Greedy Minimization of Weakly Supermodular Set Functions}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {19:119:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7568}, URN = {urn:nbn:de:0030drops75682}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.19}, annote = {Keywords: Weak Supermodularity, Greedy Algorithms, Machine Learning, Data Mining} }
Keywords:  Weak Supermodularity, Greedy Algorithms, Machine Learning, Data Mining  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 