Solving partial constraint satisfaction problems with tree decomposition
From MaRDI portal
Publication:4785233
DOI10.1002/net.10046zbMath1027.90072OpenAlexW2080959483MaRDI QIDQ4785233
Antoon W. J. Kolen, Stan P. M. van Hoesel, Arie M. C. A. Koster
Publication date: 17 December 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/b7af3f17-3aec-4858-a7fc-592a49b9343e
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)
Related Items
Safe separators for treewidth, Fixed-Parameter Tractability of Treewidth and Pathwidth, The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing, Tangle bases: Revisited, Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, Tree decompositions of graphs: saving memory in dynamic programming, D-FLAT: Declarative problem solving using tree decompositions and answer-set programming, A branch-and-price-and-cut method for computing an optimal bramble, Tree decomposition and discrete optimization problems: a survey, Treewidth computations. I: Upper bounds, A comparison of problem decomposition techniques for the FAP, Models and solution techniques for frequency assignment problems, On the maximum cardinality search lower bound for treewidth, A $c^k n$ 5-Approximation Algorithm for Treewidth, Tree decompositions and social graphs
Uses Software
Cites Work
