New Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions

  title={New Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions},
  author={I Kurzfassung},
  • I Kurzfassung
  • Published 2006
Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus many heuristic methods have been developed for finding tree decompositions and generalized hypertree… CONTINUE READING
2 Citations
20 References
Similar Papers


Publications citing this paper.
Showing 1-2 of 2 extracted citations


Publications referenced by this paper.
Showing 1-10 of 20 references

Kolotoğlu. Branch and tree decomposition techniques for discrete optimization

  • I. V. Hicks, A.M.C. A Koster
  • Tutorials in Operations Research,
  • 2005

Bucket elimination and hypertree decompositions. Implementation Report, Institute of Information Systems (DBAI)

  • Ben McMahan
  • TU Vienna,
  • 2004

Similar Papers

Loading similar papers…