The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions release_3xv3r4doxza47nu2uobydqkfwq

by Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler

Released as a article .

2020  

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.
In text/plain format

Archived Files and Locations

application/pdf  609.8 kB
file_4q7e2s7z2va3dlaaqbfqc3iyty
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-12-29
Version   v1
Language   en ?
arXiv  2012.14762v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 19e773d2-b958-4601-ae6b-846050c6421c
API URL: JSON