Constraint programming and graph algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 571-575

  Mehlhorn, Kurt ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974627444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_48     Document Type: Conference Paper

References (14)

1. E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. Efficient algorithms for dominance problems. www.mpi-sb.mpg.de/~mehlhorn/ftp/dominance.ps, March 2000.
2. N. Beldiceanu. Global constraints a graph properties on structured networks of elementary constraints of the same type. Technical Report SICS T2000/01, SICS, Uppsala, Sweden, 2000.
3. N. B. Guernalec and A. Colmerauer. Narrowing a 2n-block of sortings in O(n log n). Lecture Notes in Computer Science, 1330:2-16, 1997.
4. N. B. Guernalec and A. Colmerauer. Optimal narrowing a block of sortings in optimal time. Constraints, 5:85-118, 2000.
5. F. Glover. Maximum matchings in a convex bipartite graph. Naval Res. Logist. Quart., 14:313-316, 1967.
6. Joxan Jaffar, editor. Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming, volume 1713 of Lecture Notes in Computer Science. Alexandra, VA, USA, October 1999.
7. A. Koller, K. Mehlhorn, and J. Niehren. A polynomial-time fragment of dominance constraints. www.coli.uni-sb.de/~koller/papers/poly-dom.ps.gz, April 2000.
8. Michael Maher and Jean-Francois Puget, editors. Proceedings of the Forth International Conference on Principles and Practice of Constraint Programming, volume 1520 of Lecture Notes in Computer Science. Pisa, Italy, October 1998.
9. Kim Marriott and Peter J. Stuckey. Programming with Constraints: An Introduction. MIT Press, Cambridge, MA, 1998.
10. K. Mehlhorn and Sven Thiel. Faster algorithms for bound- consistency of the sortedness and the all different constraint. www.mpi-sb.mpg.de/~sthiel/sortedness_paper.ps.gz, March 2000.
11. Jean-Francois Puget. A fast algorithm for the bound consistency of all diff constraints. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 359-366, Menlo Park, July 26-30 AAAI Press.
12. J.-C. Regin. A filtering algorithm for constraints of difference in CSPs. In Proc. 12th Conf. American Assoc. Artificial Intelligence, volume 1, pages 362-367. Amer. Assoc. Artificial Intelligence, 1994.
13. Gert Smolka. Problem solving with constraints and programming. ACM Computing Surveys, 28(4es), December 1996. Electronic Section.
14. Pascal Van Hentenryck, Vijay Saraswat, et al. Strategic directions in constraint programming. Computing Surveys, 28(4):701-726, December 1997. ACM 50th Anniversary Issue. Strategic Directions in Computing Research.