article · Annals of Computer Science and Information Systems · 2019

A Minimum Set-Cover Problem with several constraints

Jens Dörpinghaus, Carsten Düing, Vera Weil

Cited by 2Open access

Abstract

A lot of problems in natural language processing can be interpreted using structures from discrete mathematics. In this paper we will discuss the search query and topic finding problem using a generic context-based approach. This problem can be described as a Minimum Set Cover Problem with several constraints. The goal is to find a minimum covering of documents with the given context for a fixed weight function. The aim of this problem reformulation is a deeper understanding of both the hierarchical problem using union and cut as well as the nonhierarchical problem using the union. We thus choose a modeling using bipartite graphs and suggest a novel reformulation using an integer linear program as well as novel graph-theoretic approaches.

Cite this paper

APA 7

Dörpinghaus, J., Düing, C., & Weil, V. (2019). A Minimum Set-Cover Problem with several constraints. Annals of Computer Science and Information Systems, 18, 115–122. https://doi.org/10.15439/2019f2

MLA 9

Dörpinghaus, Jens, et al. “A Minimum Set-Cover Problem with several constraints.” Annals of Computer Science and Information Systems, vol. 18, 2019, pp. 115–22, https://doi.org/10.15439/2019f2.

Chicago

Dörpinghaus, Jens, Carsten Düing, and Vera Weil. 2019. “A Minimum Set-Cover Problem with several constraints.” Annals of Computer Science and Information Systems 18: 115–22. https://doi.org/10.15439/2019f2.

Harvard

Dörpinghaus, J., Düing, C. and Weil, V. (2019) ‘A Minimum Set-Cover Problem with several constraints’, Annals of Computer Science and Information Systems, 18, pp. 115–122. Available at: https://doi.org/10.15439/2019f2.

BibTeX

@article{dorpinghaus2019minimum,
  title = {{A Minimum Set-Cover Problem with several constraints}},
  author = {Dörpinghaus, Jens and Düing, Carsten and Weil, Vera},
  journal = {Annals of Computer Science and Information Systems},
  volume = {18},
  pages = {115--122},
  year = {2019},
  doi = {10.15439/2019f2}
}

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