Publica
Hier finden Sie wissenschaftliche Publikationen aus den FraunhoferInstituten. A Minimum SetCover Problem with several constraints
 Ganzha, M. ; Institute of Electrical and Electronics Engineers IEEE: Federated Conference on Computer Science and Information Systems, FedCSIS 2019. Proceedings : September 14, 2019, Leipzig, Germany Piscataway, NJ: IEEE, 2019 (Annals of Computer Science and Information Systems 18) ISBN: 9781538680056 ISBN: 9788395235788 S.115122 
 Federated Conference on Computer Science and Information Systems (FedCSIS) <2019, Leipzig> 

 Englisch 
 Konferenzbeitrag 
 Fraunhofer SCAI () 
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 contextbased 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 graphtheoretic approaches.