Go to the corresponding LIPIcs Volume Portal 
Bhaskar, Umang ; Kumar, Gunjan
pdfformat: 

@InProceedings{bhaskar_et_al:LIPIcs:2019:11245, author = {Umang Bhaskar and Gunjan Kumar}, title = {{The Complexity of Partial Function Extension for Coverage Functions}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {30:130:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771252}, ISSN = {18688969}, year = {2019}, volume = {145}, editor = {Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11245}, URN = {urn:nbn:de:0030drops112457}, doi = {10.4230/LIPIcs.APPROXRANDOM.2019.30}, annote = {Keywords: Coverage Functions, PAC Learning, Approximation Algorithm, Partial Function Extension} }
Keywords:  Coverage Functions, PAC Learning, Approximation Algorithm, Partial Function Extension  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)  
Issue Date:  2019  
Date of publication:  17.09.2019 