Abstract
A mathematical programming problem with min-max inequalities that is reduced to finding extremal paths in AND-OR graphs is addressed. A polynomial-time path-finding algorithm in AND-OR graphs is presented. Given p arcs and n nodes, the complexity of the algorithm is O(np), which is superior to the complexity of previously known algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 283-293 |
| Number of pages | 11 |
| Journal | Mathematical Problems in Engineering |
| Volume | 8 |
| Issue number | 4-5 |
| DOIs | |
| State | Published - Sep 2002 |
| Externally published | Yes |
Bibliographical note
Funding Information:Adelson-Velsky George M. [email protected] 1 Gelbukh Alexander [email protected] 2 Levner Eugene [email protected] 3 1 Department of Mathematics and Computer Science Bar-Ilan University Ramat Gan Israel biu.ac.il 2 Center for Computing Research National Polytechnic Institute Mexico city Mexico 3 Department of Computer Science Holon Institute of Technology Holon Israel hit.ac.il 2002 8 4-5 283 293 07 02 2002 06 06 2002 2002 Copyright © 2002 This is an open access article distributed under the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We present a polynomial-time path-finding algorithm in AND-OR graphs Given p arcs and n nodes, the complexity of the algorithm is O ( n p ) , which is superior to the complexity of previously known algorithms. AND-OR graphs; Extremal paths; Scheduling; Routing; Polynomial-time algorithms http://dx.doi.org/10.13039/501100001738 Ministry of Science,Technology and space 98051-98 http://dx.doi.org/10.13039/501100003141 Consejo Nacional de Ciencia y Tecnología
Funding
Adelson-Velsky George M. [email protected] 1 Gelbukh Alexander [email protected] 2 Levner Eugene [email protected] 3 1 Department of Mathematics and Computer Science Bar-Ilan University Ramat Gan Israel biu.ac.il 2 Center for Computing Research National Polytechnic Institute Mexico city Mexico 3 Department of Computer Science Holon Institute of Technology Holon Israel hit.ac.il 2002 8 4-5 283 293 07 02 2002 06 06 2002 2002 Copyright © 2002 This is an open access article distributed under the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We present a polynomial-time path-finding algorithm in AND-OR graphs Given p arcs and n nodes, the complexity of the algorithm is O ( n p ) , which is superior to the complexity of previously known algorithms. AND-OR graphs; Extremal paths; Scheduling; Routing; Polynomial-time algorithms http://dx.doi.org/10.13039/501100001738 Ministry of Science,Technology and space 98051-98 http://dx.doi.org/10.13039/501100003141 Consejo Nacional de Ciencia y Tecnología
| Funders | Funder number |
|---|---|
| Consejo Nacional de Ciencia y Tecnología | |
| Ministry of Science,Technology and Research |
Keywords
- AND-OR graphs
- Extremal paths
- Polynomial-time algorithms
- Routing
- Scheduling