Using dominators for solving constrained path problems

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

Volumn 3819 LNCS, Issue , 2005, Pages 73-87

  Quesada, Luis ^a   Van Roy, Peter ^a   Deville, Yves ^a   Collet, Raphaël ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING;

CONSTRAINED PATH PROBLEMS; CONSTRAINT PROGRAMMING; DOMINATORS; ORDERED DISJOINT-PATHS PROBLEM (ODP);

MOTION PLANNING;

EID: 33745472212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603023_6     Document Type: Conference Paper

References (28)

1. [AU77] A. V. Aho and J. D. Ullman. Principles of Compiler Design. Addison-Wesley, 1977.
2. [BC94] N. Beldiceanu and E. Contjean. Introducing global constraints in CHIP. Mathematical and Computer Modelling, 12:97-123, 1994.
3. [Bou99] Eric Bourreau. Traitement de contraintes sur les graphes en programmation par contraintes. Doctoral dissertation, Université Paris, Paris, France, 1999.
4. [CB04] Hadrien Cambazard and Eric Bourreau. Conception d'une contrainte globale de chemin. In I0e Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC'04), pages 107-121, Angers, France, June 2004.
5. [CL97] Yves Caseau and Francois Laburthe. Solving small TSPs with constraints. In International Conference on Logic Programming, pages 316-330, 1997.
6. [CLR90] T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1990.
7. [DDD04] G. Dooms, Y. Deville, and P. Dupont. Constrained path finding in biochemical networks. In Sèmes Journées Ouvertes Biologie Informatique Mathématiques, 2004.
8. [DDD05] G. Dooms, Y. Deville, and P. Dupont. CP(Graph):introducing a graph computation domain in constraint programming. In CP2005 Proceedings, 2005.
9. 2) barrier. In IEEE Symposium on Foundations of Computer Science, pages 381-389, 2000.
10. [DPc] A disjoint-paths problem solved with Reachability. Available at http://www.info.ucl.ac.be/~luque/PADL06/DPcase.ps.
11. [FLM99] F Focacci, A. Lodi, and M. Milano. Solving tsp with time windows with constraints. In CLP'99 International Conference on Logic Programming Proceedings, 1999.
12. [GJ79] Michael Garey and David Johnson. Computers and Intractability: A Guide to the The Theory of NP-Completeness. W. H. Freeman and Company, 1979.
13. [LT79] T. Lengauer and R. Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems, 1(1):121-141, July 1979.
14. [Moz04] Mozart Consortium. The Mozart Programming System, version 1.3.0, 2004. Available at http://www.mozart-oz.org/.
15. [Mül01] Tobias Müller. Constraint Propagation in Mozart. Doctoral dissertation, Universität des Saarlandes, Naturwissenschaftlich- Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany, 2001.
16. [PGPR96] G. Pesant, M. Gendreau, J. Potvin, and J. Rousseau. An exact constraint logic programming algorithm for the travelling salesman with time windows, 1996.
17. [QVD05a] Luis Quesada, Peter Van Roy, and Yves Deville. Reachability: a constrained path propagator implemented as a multi-agent system. In CLEI2005 Proceedings, 2005.
18. [QVD05b] Luis Quesada, Peter Van Roy, and Yves Deville. The reachability propagator. Research Report INFO-2005-07, Université catholique de Louvain, Louvain-la-Neuve, Belgium, 2005.
19. [Rég94] Jean Charles Régin. A filtering algorithm for constraints of difference in csps. In In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 362-367, 1994.
20. [Sch00] Christian Schulte. Programming Constraint Services. Doctoral dissertation, Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany, 2000.
21. [Sel02] Meinolf Sellmann. Reduction Techniques in Constraint Programming and Combinatorial Optimization. Doctoral dissertation, University of Paderborn, Paderborn, Germany, 2002.
22. [SGL97] Vugranam C. Sreedhar, Guang R. Gao, and Yong-Fong Lee. Incremental computation of dominator trees. ACM Transactions on Programming Languages and Systems, 19(2):239-252, March 1997.
23. [SP78] Y. Shiloach and Y. Perl. Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM, 1978.
24. [SPMa] Spmn_22. Available at http://www.info.ucl.ac.be/~luque/PADL06/ test_22.ps.
25. [SPMb] Spmn_22full. Available at http://www.info.ucl.ac.be/~luque/PADL06/ test_22full.ps.
26. [SPMc] Spmn_52a. Available at http://www.info.ucl.ac.be/~luque/PADL06/ test_52.ps.
27. [SPMd] Spmn_52full. Available at http://www.info.ucl.ac.be/~luque/PADL06/ test_52full.ps.
28. [VH04] P. Van Roy and S. Haridi. Concepts, Techniques, and Models of Computer Programming. The MIT Press, 2004.