Algorithms and Constraint Programming
暂无分享,去创建一个
[1] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.
[2] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[3] Fabrizio Grandoni,et al. Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms , 2005, Bull. EATCS.
[4] Fedor V. Fomin,et al. Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In , 2004, ICALP.
[5] Jon M. Kleinberg,et al. A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..
[6] John Michael Robson,et al. Algorithms for Maximum Independent Sets , 1986, J. Algorithms.
[7] Fabrizio Grandoni,et al. Measure and conquer: a simple O(20.288n) independent set algorithm , 2006, SODA '06.
[8] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[9] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[10] J. Sheehan,et al. On the number of complete subgraphs contained in certain graphs , 1981, J. Comb. Theory, Ser. B.
[11] Gerhard J. Woeginger,et al. Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.
[12] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[13] Andrea Maggiolo-Schettini,et al. Dynamic Graphs , 1996, MFCS.
[14] Christian Bessiere,et al. Using Inference to Reduce Arc Consistency Computation , 1995, IJCAI.
[15] Alon Itai,et al. Finding a minimum circuit in a graph , 1977, STOC '77.
[16] Jesper Makholm Byskov. Enumerating maximal independent sets with applications to graph colouring , 2004, Oper. Res. Lett..
[17] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[18] Vijay A. Saraswat,et al. The concurrent logic programming language CP: Definition and operational semantics , 1987, POPL '87.
[19] Uwe Schöning,et al. Algorithmics in Exponential Time , 2005, STACS.
[20] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..
[21] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[22] Giuseppe F. Italiano,et al. Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures , 2006, J. Discrete Algorithms.
[23] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[24] Stefan Richter,et al. A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.
[25] Gerhard J. Woeginger,et al. Space and Time Complexity of Exact Algorithms : Some Open Problems , 2004 .
[26] Christian Bessiere,et al. From Restricted Path Consistency to Max-Restricted Path Consistency , 1997, CP.
[27] Rina Dechter,et al. Network-based heuristics for constraint satisfaction problems , 1988 .
[28] Giuseppe F. Italiano,et al. Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier , 2005, JACM.
[29] Fabrizio Grandoni,et al. Improved Algorithms for Max-restricted Path Consistency , 2003, CP.
[30] Jean-François Puget,et al. A Fast Algorithm for the Bound Consistency of alldiff Constraints , 1998, AAAI/IAAI.
[31] Romuald Debruyne. A Property of Path Inverse Consistency Leading to an Optimal PIC Algorithm , 2000, ECAI.
[32] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[33] Walter Kern,et al. An improved deterministic local search algorithm for 3-SAT , 2004, Theor. Comput. Sci..
[34] Kazuo Iwama,et al. Worst-Case Upper Bounds for kSAT (Column: Algorithmics) , 2004, Bull. EATCS.
[35] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[36] Richard Beigel,et al. Finding maximum independent sets in sparse and general graphs , 1999, SODA '99.
[37] Eugene C. Freuder,et al. Neighborhood Inverse Consistency Preprocessing , 1996, AAAI/IAAI, Vol. 1.
[38] Victor Y. Pan,et al. Fast Rectangular Matrix Multiplication and Applications , 1998, J. Complex..
[39] Fedor V. Fomin,et al. Exact algorithms for treewidth and minimum fill-in ∗ † , 2006 .
[40] Fabrizio Grandoni,et al. Measure and Conquer: Domination - A Case Study , 2005, ICALP.
[41] Ryan Williams,et al. A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..
[42] Ryan Williams. A new algorithm for optimal constraint satisfaction and its implications , 2004, Electron. Colloquium Comput. Complex..
[43] Kostas Stergiou,et al. Representation and reasoning with non-binary constraints , 2001 .
[44] Pascal Van Hentenryck. The OPL optimization programming language , 1999 .
[45] Igor Razgon. Exact Computation of Maximum Induced Forest , 2006, SWAT.
[46] Kurt Mehlhorn,et al. Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint , 2000, CP.
[47] Fabrizio Grandoni,et al. Decremental Clique Problem , 2004, WG.
[48] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.
[49] David Eppstein,et al. 3-Coloring in Time O(1.3289^n) , 2000, J. Algorithms.
[50] F. Glover. Maximum matching in a convex bipartite graph , 1967 .