@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},
}

{"_id":"HHHyRvQnjuoNiJM3g","bibbaseid":"jgou-ndiaye-terrioux-computingandexploitingtreedecompositionsforsolvingconstraintnetworks-2005","authorIDs":[],"author_short":["Jégou, P.","Ndiaye, S.","Terrioux, C."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Jégou"],"firstnames":["Philippe"],"suffixes":[]},{"propositions":[],"lastnames":["Ndiaye"],"firstnames":["Samba"],"suffixes":[]},{"propositions":[],"lastnames":["Terrioux"],"firstnames":["Cyril"],"suffixes":[]}],"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":"Lect Notes Comput Sci","pages":"777–781","publisher":"Springer, Berlin","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","bibtex":"@InProceedings{jegou05computing,\n author = {J\\'egou, Philippe and Ndiaye, Samba and Terrioux, Cyril},\n title = {Computing and Exploiting Tree-Decompositions for Solving Constraint Networks},\n booktitle = {Proc. of Principles and Practice of Constraint Programming (CP 2005)},\n year = {2005},\n volume = {3709},\n series = lncs,\n pages = {777--781},\n publisher = Springer,\n 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.},\n doi = {10.1007/11564751_63},\n journal = {Principles and Practice of Constraint Programming - CP 2005},\n keywords = {fpt},\n owner = {Sebastian},\n timestamp = {2008.08.06},\n}\n\n","author_short":["Jégou, P.","Ndiaye, S.","Terrioux, C."],"key":"jegou05computing","id":"jegou05computing","bibbaseid":"jgou-ndiaye-terrioux-computingandexploitingtreedecompositionsforsolvingconstraintnetworks-2005","role":"author","urls":{},"keyword":["fpt"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.147Z","downloads":0,"keywords":["fpt"],"search_terms":["computing","exploiting","tree","decompositions","solving","constraint","networks","jégou","ndiaye","terrioux"],"title":"Computing and Exploiting Tree-Decompositions for Solving Constraint Networks","year":2005,"dataSources":["C5FtkvWWggFfMJTFX"]}