{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:26Z","timestamp":1725680366841},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_11","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"163-179","source":"Crossref","is-referenced-by-count":5,"title":["Constraint Optimization Problems and Bounded Tree-Width Revisited"],"prefix":"10.1007","author":[{"given":"Tommy","family":"F\u00e4rnqvist","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 739\u2013748 (2008)","DOI":"10.1109\/FOCS.2008.43"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM\u00a030, 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"issue":"8","key":"11_CR3","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1016\/j.jcss.2010.04.003","volume":"76","author":"H. Chen","year":"2010","unstructured":"Chen, H., Grohe, M.: Constraint satisfaction with succinctly specified relations. Journal of Computer and System Sciences\u00a076(8), 847\u2013860 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"F.R. Chung","year":"1986","unstructured":"Chung, F.R., Graham, R.L., Frankl, P., Shearer, J.B.: Some intersection theorems for ordered sets and graphs. Journal of Combinatorial Theory Series A\u00a043, 23\u201337 (1986)","journal-title":"Journal of Combinatorial Theory Series A"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.jcss.2007.08.001","volume":"74","author":"D. Cohen","year":"2008","unstructured":"Cohen, D., Jeavons, P., Gyssens, M.: A unified theory of structural tractability for constraint satisfaction problems. Journal of Computer and System Sciences\u00a074(5), 721\u2013743 (2008)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR6","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks (research note). Artificial Intelligence\u00a038, 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing\u00a024(4), 873\u2013921 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"1-2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science\u00a0141(1-2), 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM\u00a030, 514\u2013550 (1983)","journal-title":"Journal of the ACM"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM Journal on Computing\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR12","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1-3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E.C. Freuder","year":"1992","unstructured":"Freuder, E.C., Wallace, R.J.: Partial constraint satisfaction. Artificial Intelligence\u00a058(1-3), 21\u201370 (1992)","journal-title":"Artificial Intelligence"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E.C. Freuder","year":"1985","unstructured":"Freuder, E.C.: A sufficient condition for backtrack-bounded search. Journal of the ACM\u00a032, 755\u2013761 (1985)","journal-title":"Journal of the ACM"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/978-3-540-77120-3_55","volume-title":"Algorithms and Computation","author":"T. F\u00e4rnqvist","year":"2007","unstructured":"F\u00e4rnqvist, T., Jonsson, P.: Bounded Tree-Width and CSP-Related Problems. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 632\u2013643. Springer, Heidelberg (2007)"},{"key":"11_CR16","unstructured":"de Givry, S., Schiex, T., Verfaillie, G.: Exploiting tree decompositions and soft local consistency in weighted CSP. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), pp. 22\u201327 (2006)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G.: On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC 2007), pp. 152\u2013161 (2007)","DOI":"10.1145\/1250910.1250934"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-02930-1_2","volume-title":"Automata, Languages and Programming","author":"G. Gottlob","year":"2009","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 16\u201330. Springer, Heidelberg (2009)"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. Journal of Computer and System Sciences\u00a064(3), 579\u2013627 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206035.1206036","volume":"54","author":"M. Grohe","year":"2007","unstructured":"Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM\u00a054(1), 1\u201324 (2007)","journal-title":"Journal of the ACM"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 289\u2013298 (2006)","DOI":"10.1145\/1109557.1109590"},{"issue":"6","key":"11_CR22","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.06.012","volume":"154","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Rafiey, A., Yeo, A., Tso, M.: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics\u00a0154(6), 881\u2013889 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-62559-3_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L.G. Kroon","year":"1997","unstructured":"Kroon, L.G., Sen, A., Roy, H.D.: The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. In: D\u2019Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol.\u00a01197, pp. 279\u2013292. Springer, Heidelberg (1997)"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721845","volume":"6","author":"D. Marx","year":"2010","unstructured":"Marx, D.: Approximating fractional hypertree width. ACM Transactions on Algorithms\u00a06, 1\u201317 (2010)","journal-title":"ACM Transactions on Algorithms"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Marx, D.: Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 735\u2013744 (2010)","DOI":"10.1145\/1806689.1806790"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00224-009-9248-9","volume":"48","author":"D. Marx","year":"2011","unstructured":"Marx, D.: Tractable structures for constraint satisfaction with truth tables. Theory of Computing Systems\u00a048, 444\u2013464 (2011)","journal-title":"Theory of Computing Systems"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Ndiaye, S., J\u00e9gou, P., Terrioux, C.: Extending to soft and preference constraints a framework for solving efficiently structured problems. In: Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), pp. 299\u2013306 (2008)","DOI":"10.1109\/ICTAI.2008.109"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Reed, B.A.: Finding approximate separators and computing tree width quickly. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (STOC 1992), pp. 221\u2013228 (1992)","DOI":"10.1145\/129712.129734"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jcss.2009.04.003","volume":"76","author":"M. Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. Journal of Computer and System Sciences\u00a076, 103\u2013114 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR30","unstructured":"Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: hard and easy problems. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 631\u2013637 (1995)"},{"key":"11_CR31","unstructured":"Takhanov, R.: A dichotomy theorem for the general minimum cost homomorphism problem. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), pp. 657\u2013668 (2010)"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/978-3-540-45193-8_48","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C. Terrioux","year":"2003","unstructured":"Terrioux, C., J\u00e9gou, P.: Bounded Backtracking for the Valued Constraint Satisfaction Problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 709\u2013723. Springer, Heidelberg (2003)"},{"key":"11_CR33","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proceedings of the Seventh International Conference on Very Large Data Bases, VLDB 1981, vol.\u00a07, pp. 82\u201394 (1981)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:38Z","timestamp":1620127058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}