Abstract
Constrained path problems have to do with finding paths in graphs subject to constraints. We present a constraint programming approach for solving the Ordered disjoint-paths problem (ODP), i.e., the Disjoint-paths problem where the pairs are associated with ordering constraints. In our approach, we reduce ODP to the Ordered simple path with mandatory nodes problem (OSPMN), i.e., the problem of finding a simple path containing a set of mandatory nodes in a given order. The reduction of the problem is motivated by the fact that we have an appropriate way of dealing with OSPMN based on DomReachability, a propagator that implements a generalized reachability constraint on a directed graph based on the concept of graph variables.
The DomReachability constraint has three arguments: (1) a flow graph, i.e., a directed graph with a source node; (2) the dominance relation graph on nodes and edges of the flow graph; and (3) the transitive closure of the flow graph.
Our experimental evaluation of DomReachability shows that it provides strong pruning, obtaining solutions with very little search. Furthermore, we show that DomReachability is also useful for defining a good labeling strategy. These experimental results give evidence that DomReachability is a useful primitive for solving constrained path problems over directed graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: Principles of Compiler Design. Addison-Wesley, Reading (1977)
Beldiceanu, N., Contjean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling 12, 97–123 (1994)
Bourreau, E.: Traitement de contraintes sur les graphes en programmation par contraintes. Doctoral dissertation, Université Paris, Paris, France (1999)
Cambazard, H., Bourreau, E.: Conception d’une contrainte globale de chemin. In: 10e Journées nationales sur la résolution pratique de problèmes NP-complets (JNPC 2004), Angers, France, pp. 107–121 (June 2004)
Caseau, Y., Laburthe, F.: Solving small TSPs with constraints. In: International Conference on Logic Programming, pp. 316–330 (1997)
Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Cambridge (1990)
Dooms, G., Deville, Y., Dupont, P.: Constrained path finding in biochemical networks. In: 5èmes Journées Ouvertes Biologie Informatique Mathématiques (2004)
Dooms, G., Deville, Y., Dupont, P.: CP(Graph):introducing a graph computation domain in constraint programming. In: CP 2005 Proceedings (2005)
Demetrescu, C., Italiano, G.F.: Fully dynamic transitive closure: Breaking through the O(n 2) barrier. In: IEEE Symposium on Foundations of Computer Science, pp. 381–389 (2000)
A disjoint-paths problem solved with Reachability. Available at, http://www.info.ucl.ac.be/~luque/PADL06/DPcase.ps
Focacci, F., Lodi, A., Milano, M.: Solving tsp with time windows with constraints. In: CLP 1999 International Conference on Logic Programming Proceedings (1999)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the The Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Lengauer, T., Tarjan, R.: A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems 1(1), 121–141 (1979)
Consortium, M.: The Mozart Programming System, version 1.3.0 (2004), Available at, http://www.mozart-oz.org/
Müller, T.: Constraint Propagation in Mozart. Doctoral dissertation, Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany (2001)
Pesant, G., Gendreau, M., Potvin, J., Rousseau, J.: An exact constraint logic programming algorithm for the travelling salesman with time windows (1996)
Quesada, L., van Roy, P., Deville, Y.: Reachability: a constrained path propagator implemented as a multi-agent system. In: CLEI 2005 Proceedings (2005)
Quesada, L., van Roy, P., Deville, Y.: The reachability propagator. Research Report INFO-2005-07, Université catholique de Louvain, Louvain-la-Neuve, Belgium (2005)
Régin, J.C.: A filtering algorithm for constraints of difference in csps. In: Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 362–367 (1994)
Schulte, C.: Programming Constraint Services. Doctoral dissertation, Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany (2000)
Sellmann, M.: Reduction Techniques in Constraint Programming and Combinatorial Optimization. Doctoral dissertation, University of Paderborn, Paderborn, Germany (2002)
Sreedhar, V.C., Gao, G.R., Lee, Y.-F.: Incremental computation of dominator trees. ACM Transactions on Programming Languages and Systems 19(2), 239–252 (1997)
Shiloach, Y., Perl, Y.: Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM (1978)
Spmn_22. Available at, http://www.info.ucl.ac.be/~luque/PADL06/test_22.ps
Spmn_22full. Available at, http://www.info.ucl.ac.be/~luque/PADL06/test_22full.ps
Spmn_52a. Available at, http://www.info.ucl.ac.be/~luque/PADL06/test_52.ps
Spmn_52full. Available at, http://www.info.ucl.ac.be/~luque/PADL06/test_52full.ps
Van Roy, P., Haridi, S.: Concepts, Techniques, and Models of Computer Programming. The MIT Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quesada, L., Van Roy, P., Deville, Y., Collet, R. (2005). Using Dominators for Solving Constrained Path Problems. In: Van Hentenryck, P. (eds) Practical Aspects of Declarative Languages. PADL 2006. Lecture Notes in Computer Science, vol 3819. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603023_6
Download citation
DOI: https://doi.org/10.1007/11603023_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30947-5
Online ISBN: 978-3-540-31685-5
eBook Packages: Computer ScienceComputer Science (R0)