Talks and Poster Presentations (with Proceedings-Entry):

G. Gottlob, M. Lanzinger, D. Longo, C. Okulmus, R. Pichler:
"The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions";
Talk: CPAIOR 2020, Wien (invited); 2020-09-21 - 2020-09-24; in: "Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 17th International Conference, {CPAIOR} 2020", Springer, 12296 (2020), 3 - 21.

English abstract:
Constraint Satisfaction Problems (CSPs) play a central role
in many applications in Artificial Intelligence and Operations Research.
In general, solving CSPs is NP-complete. The structure of CSPs is best
described by hypergraphs. Therefore, various forms of hypergraph decompositions have been proposed in the literature to identify tractable fragments of CSPs. However, also the computation of a concrete hypergraph decomposition is a challenging task in itself. In this paper, we report on recent progress in the study of hypergraph decompositions and we outline several directions for future research.

artificial intelligence combinatorial optimization communication systems computer hardware computer networks computer programming computer science computer systems constraint programming engineering genetic algorithms graph theory internet machine learni

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Related Projects:
Project Head Reinhard Pichler:

Created from the Publication Database of the Vienna University of Technology.