Umang Bhaskar, Gunjan Kumar. The Complexity of Partial Function Extension for Coverage Functions. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]
@inproceedings{BhaskarK19, title = {The Complexity of Partial Function Extension for Coverage Functions}, author = {Umang Bhaskar and Gunjan Kumar}, year = {2019}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.30}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.30}, researchr = {https://researchr.org/publication/BhaskarK19}, cites = {0}, citedby = {0}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA}, editor = {Dimitris Achlioptas and László A. Végh}, volume = {145}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-125-2}, }