Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. Jégou, P., Ndiaye, S., & Terrioux, C. In Proc. of Principles and Practice of Constraint Programming (CP 2005), volume 3709, of Lect Notes Comput Sci, pages 777–781, 2005. Springer, Berlin.
doi  abstract   bibtex   
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real practical interest yet. In this paper, we study several methods for computing a rough optimal tree-decomposition and assess their relevance for solving CSPs.
@InProceedings{jegou05computing,
  author    = {J\'egou, Philippe and Ndiaye, Samba and Terrioux, Cyril},
  title     = {Computing and Exploiting Tree-Decompositions for Solving Constraint Networks},
  booktitle = {Proc. of Principles and Practice of Constraint Programming (CP 2005)},
  year      = {2005},
  volume    = {3709},
  series    = lncs,
  pages     = {777--781},
  publisher = Springer,
  abstract  = {Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real practical interest yet. In this paper, we study several methods for computing a rough optimal tree-decomposition and assess their relevance for solving CSPs.},
  doi       = {10.1007/11564751_63},
  journal   = {Principles and Practice of Constraint Programming - CP 2005},
  keywords  = {fpt},
  owner     = {Sebastian},
  timestamp = {2008.08.06},
}

Downloads: 0