Formal-language-constrained path problems

SIAM Journal on Computing

Volumn 30, Issue 3, 2000, Pages 809-837

  Barrett, Chris ^a   Jacob, Riko ^b   Marathe, Madhav ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Algorithms; Computational complexity; Formal languages; Multicriteria problems; Query processing; Shortest paths; Transportation planning; World Wide Web

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; QUERY LANGUAGES; WORLD WIDE WEB;

CONTEXT-FREE LANGUAGES (CFL);

FORMAL LANGUAGES;

EID: 0034932682     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798337716     Document Type: Article

References (41)

1. S. ABITEBOUL AND V. VIANU, Regular path queries with constraints, J. Comput. System Sci., 58 (1999), pp. 428-452.
2. M. BEN-AKIVA AND S. R. LERMAN, Discrete Choice Analysis, MIT Press Ser. Transportation Stud., MIT Press, Cambridge, MA, 1985.
3. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
4. S. ARNBORG, B. COURCELLE, A. PROSKUROWSKI, AND D. SEESE, An algebraic theory of graph reductions, J. ACM, 40 (1993), pp. 1134-1164.
5. G. AROCENA, A. MENDELZON, AND G. MIHAILA, Applications of a Web query language, in Proceedings of the 6th International WWW Conference, Santa Clara, CA, 1997.
6. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
7. D. ANSON, C. BARRETT, D. KUBICEK, M. MARATHE, K. NAGEL, M. RICKERT, AND M. STEIN, Engineering the Route Planner for Dallas Case Study, Technical report, Los Alamos National Laboratory, Los Alamos, NM, 1997.
8. S. ARNBORG, J. LAGERGREN, AND D. SEESE, Easy problems for tree-decomposable graphs, J. Algorithms, 12 (1991), pp. 308-340.
9. H. L. BODLAENDER, Dynamic programming on graphs of bounded treewidth, in Proceedings of the 15th International Colloquium on Automata Language and Programming, Lecture Notes in Comput. Sci. 317, Springer-Verlag, New York, 1988, pp. 105-118.
10. H. L. BODLAENDER, A tourist guide through treewidth, Technical report RUU-CS-92-12, Utrecht University, The Netherlands, 1992.
11. M. W. BERN, E. L. LAWLER, AND A. L. WONG, Linear-time computation of optimal subgraphs of decomposable graphs, J. Algorithms, 8 (1987), pp. 216-235.
12. V. BLUE, J. ADLER, AND G. LIST, Real-time multiple objective path search for in-vehicle route guidance systems, in Proceedings of the 76th Annual Meeting of the Transportation Research Board, Washington, D.C., 1997.
13. A. L. BUCHSBAUM, P. C. KANELLAKIS, AND J. S. VITTER, A data structure for arc insertion and regular path finding, in Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, SIAM, Philadelphia, PA, 1990, pp. 22-31.
14. C. BARRETT, R. JACOB, G. KONJEVOD, R. BECKMAN, K. BISSET, AND M. MARATHE, Routing Problems in TRANSIMS: Theory, Practice and Validation, Technical report, Los Alamos National Laboratory, Los Alamos, NM, 1999.
15. M. CRUZ, A. MENDELZON, AND P. WOOD, A graphical query language supporting recursion, in Proceedings of the 9th ACM SIGMOD Conference on Management of Data, San Francisco, CA, ACM, New York, 1987, pp. 323-330.
16. +: Recursive queries without recursion, in Proceedings of the 2nd International Conference on Expert Data Base Systems, Tysons Corner, CA, ACM, New York, 1988, pp. 25-27.
17. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, McGraw-Hill, New York, 1990.
18. M. R. GAREY AND D. S. JOHNSON, Computers and intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
19. F. G. HALASZ, Reflections on notecards: Seven issues for the next generation of hypermedia systems, Comm. ACM, 31 (1988), pp. 836-852.
20. P. HART, N. NILSSON, AND B. RAPHEL, A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. System Sci. Cybernetics, 2 (1968), pp. 100-107.
21. R. HASSIN, Approximation schemes for the restricted shortest path problem, Math. Oper. Res., 17 (1992), pp. 36-42.
22. HIGHWAY RESEARCH BOARD, Highway Capacity Manual, Special Report 209, National Research Council, Washington, D.C., 1994.
23. J. E. HOPCROFT AND J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
24. U. HUCKENBECK, Extremal paths in graphs. Foundations, search strategies, and related topics, Math. Top. 10, Akademie Verlag, Berlin, 1997.
25. R. JACOB, C. BARRETT, AND M. MARATHE, Models and efficient algorithms for class of routing problems in time dependent and labeled networks, Technical report, Los Alamos National Laboratory, Los Alamos, NM, 1999.
26. R. JACOB, M. MARATHE, AND K. NAGEL, A computational study of routing algorithms for realistic transportation networks, in Proceedings of the 2nd Workshop on Algorithmic Engineering, Saarbrucken, Germany, 1998; ACM J. Exp. Algorithmics, to appear.
27. D. E. KNUTH, A generalization of Dijkstra's algorithm, Inform. Process. Lett., 6 (1977), pp 1-5.
28. H. B. HUNT III, D. ROSENKRANTZ, AND T. SZYMANSKI, On the equivalence, containment and covering problems for regular and context free grammars, J. Comput. System Sci., 12 (1976), pp. 222-268.
29. A. O. MENDELZON AND P. T. WOOD, Finding regular simple paths in graph databases, SIAM J. Comput., 24 (1995), pp. 1235-1258.
30. M. V. MARATHE, R. RAVI, R. SUNDARAM, S. S. RAVI, D. J. ROSENKRANTZ, AND H. B. HUNT III, Bicriteria network design problems, J. Algorithms, 28 (1998), pp. 142-171.
31. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
32. J. ROUMEUF, Shortest paths under rational constraints, Inform. Process. Lett., 28 (1988), pp. 245-248.
33. K. SCOTT, G. PABON-JIMENEZ, AND D. BERNSTEIN, Finding alternatives to the best path, in Proceedings of the 76th Annual Meeting of the Transportation Research Board, Washington, D.C., 1997.
34. H. STRAUBING, Finite Automata, Formal Logic, and Circuit Complexity, Progr. Theoret. Comput. Sci., Birkhäuser Boston, Boston, MA, 1994.
35. C. BARRETT, K. BIRKBIGLER, L. SMITH, V. LOOSE, R. BECKMAN, J. DAVIS, D. ROBERTS, AND M. WILLIAMS, An Operational Description of TRANSIMS, Technical report LA-UR-95-2393, Los Alamos National Laboratory, Los Alamos, NM, 1995.
36. L. SMITH, R. BECKMAN, K. BAGGERLY, D. ANSON, AND M. WILLIAMS, Overview of TRANSIMS, the TRansportation ANalysis and SIMulation System, Technical report LA-UR-95-1641, Los Alamos National Laboratory, Los Alamos, NM, 1995.
37. R. TARJAN, A unified approach to path problems, J. ACM, 28-3 (1981), pp. 577-593.
38. A. ORDA AND R. ROM, Shortest path and minimium delay algorithms in networks with time dependent edge lengths, J. ACM, 37 (1990), pp. 607-625.
39. G. RAMALINGAM AND T. REPS, An incremental algorithm for a generalization of the shortest-path problem, J. Algorithms, 21 (1996), pp. 267-305.
40. M. YANNAKAKIS Graph theoretic methods in database theory, in Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems, Nashville, TN, ACM, New York, 1990, pp. 230-242.
41. M. YANNAKAKIS, Perspectives in database theory, in Proceedings of the 36th Annual IEEE Symposium on Foundation of Computer Science, ACM, New York, 1995, pp. 224-246.