Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
暂无分享,去创建一个
[1] Francesca Rossi,et al. Semiring-based constraint satisfaction and optimization , 1997, JACM.
[2] Jan Kratochvíl,et al. Satisfiability of co-nested formulas , 2005, Acta Informatica.
[3] S. Poljak. A note on stable sets and colorings of graphs , 1974 .
[4] Rina Dechter,et al. Network-based heuristics for constraint satisfaction problems , 1988 .
[5] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[6] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[7] Rustem Takhanov,et al. A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem , 2007, STACS.
[8] Thomas Schiex,et al. Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.
[9] Vladimir Kolmogorov,et al. Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions , 2010, MFCS.
[10] Sanjeev Khanna,et al. Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.
[11] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[12] Thomas Schiex,et al. Soft Constraints , 2000, WLP.
[13] Martin C. Cooper,et al. Hybrid tractability of valued constraint problems , 2010, Artif. Intell..
[14] Jimmy Ho-man Lee,et al. Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction , 2009, IJCAI 2009.
[15] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..
[16] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[17] Peter Jonsson,et al. Min CSP on Four Elements: Moving beyond Submodularity , 2011, CP.
[18] Martin C. Cooper,et al. Hierarchically Nested Convex VCSP , 2011, CP.
[19] Alessandro Zanarini,et al. Generalizations of the Global Cardinality Constraint for Hierarchical Resources , 2007, CPAIOR.
[20] Umberto Bertelè,et al. Nonserial Dynamic Programming , 1972 .
[21] Gilles Pesant,et al. On global warming: Flow-based soft global constraints , 2006, J. Heuristics.
[22] Steffen L. Lauritzen,et al. Graphical models in R , 1996 .
[23] Martin C. Cooper,et al. Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms , 2008, Theor. Comput. Sci..
[24] David A. Cohen,et al. A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure , 2003, CP.
[25] Luca Trevisan,et al. The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..
[26] William J. Cook,et al. Combinatorial optimization , 1997 .
[27] M. Minoux. Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .
[28] Rodney G. Downey. A Parameterized Complexity Tutorial , 2012, LATA.
[29] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[30] Peter Jeavons,et al. On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..
[31] Donald E. Knuth,et al. Nested satisfiability , 1989, Acta Informatica.
[32] A. Goodman. On Sets of Acquaintances and Strangers at any Party , 1959 .
[33] Martin C. Cooper,et al. Tractable Triangles , 2011, CP.
[34] Martin C. Cooper,et al. The complexity of soft constraint satisfaction , 2006, Artif. Intell..
[35] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[36] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[37] Martin C. Cooper,et al. Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination , 2010, Artif. Intell..
[38] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[39] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[40] Peter Jeavons,et al. The Complexity of Constraint Languages , 2006, Handbook of Constraint Programming.
[41] Vladimir Kolmogorov,et al. The complexity of conservative valued CSPs , 2011, JACM.
[42] Donald Geman,et al. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .
[43] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[44] John M. Lewis,et al. The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..
[45] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[46] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[47] Martin Grohe,et al. The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[48] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[49] Myriam Preissmann,et al. On the NP-completeness of the k-colorability problem for triangle-free graphs , 1996, Discret. Math..
[50] Gustav Nordh,et al. MAX ONES Generalized to Larger Domains , 2008, SIAM J. Comput..
[51] Jean-Charles Régin,et al. Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.
[52] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[53] Philip Thomas Henderson,et al. Planar Graphs and Partial k-Trees , 2005 .
[54] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[55] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[56] Phokion G. Kolaitis,et al. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.
[57] Martin C. Cooper,et al. On Guaranteeing Polynomially Bounded Search Tree Size , 2011, International Conference on Principles and Practice of Constraint Programming.
[58] P. Jonsson,et al. Introduction to the Maximum Solution Problem , 2007 .
[59] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[60] M. Minoux. A polynomial algorithm for minimum quadratic cost flow problems , 1984 .
[61] Tomás Werner,et al. A Linear Programming Approach to Max-Sum Problem: A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[62] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.
[63] Sanjeev Khanna,et al. 3. Boolean Constraint Satisfaction Problems , 2001 .