book chapter · Lecture notes in computer science · 2016

The Minimum Entropy Submodular Set Cover Problem

Gabriel Istrate, Cosmin Bonchiş, Liviu P. Dinu

Cited by 2Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Istrate, G., Bonchiş, C., & Dinu, L. P. (2016). The Minimum Entropy Submodular Set Cover Problem. Lecture notes in computer science, 295–306. https://doi.org/10.1007/978-3-319-30000-9_23

MLA 9

Istrate, Gabriel, et al. “The Minimum Entropy Submodular Set Cover Problem.” Lecture notes in computer science, 2016, pp. 295–306, https://doi.org/10.1007/978-3-319-30000-9_23.

Chicago

Istrate, Gabriel, Cosmin Bonchiş, and Liviu P. Dinu. 2016. “The Minimum Entropy Submodular Set Cover Problem.” Lecture notes in computer science: 295–306. https://doi.org/10.1007/978-3-319-30000-9_23.

Harvard

Istrate, G., Bonchiş, C. and Dinu, L.P. (2016) ‘The Minimum Entropy Submodular Set Cover Problem’, Lecture notes in computer science, pp. 295–306. Available at: https://doi.org/10.1007/978-3-319-30000-9_23.

BibTeX

@incollection{istrate2016minimum,
  title = {{The Minimum Entropy Submodular Set Cover Problem}},
  author = {Istrate, Gabriel and Bonchiş, Cosmin and Dinu, Liviu P.},
  booktitle = {Lecture notes in computer science},
  pages = {295--306},
  year = {2016},
  doi = {10.1007/978-3-319-30000-9_23}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.