Hellerstein, L., Lidbetter, T, and Witter, R.T. A Local Search Algorithm for the Min-Sum Submodular Cover Problem. Retrieved from https://par.nsf.gov/biblio/10476816. Leibniz international proceedings in informatics .

Hellerstein, L., Lidbetter, T, & Witter, R.T. A Local Search Algorithm for the Min-Sum Submodular Cover Problem. Leibniz international proceedings in informatics, (). Retrieved from https://par.nsf.gov/biblio/10476816.

Hellerstein, L., Lidbetter, T, and Witter, R.T. "A Local Search Algorithm for the Min-Sum Submodular Cover Problem". Leibniz international proceedings in informatics (). Country unknown/Code not available: Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. https://par.nsf.gov/biblio/10476816.

@article{osti_10476816,
place = {Country unknown/Code not available}, title = {A Local Search Algorithm for the Min-Sum Submodular Cover Problem}, url = {https://par.nsf.gov/biblio/10476816}, abstractNote = {}, journal = {Leibniz international proceedings in informatics}, publisher = {Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany}, author = {Hellerstein, L. and Lidbetter, T and Witter, R.T.}, editor = {Bae, S.W. and Park, H.} }