An introduction to parallel dynamic programming

  • Marc Gengler
Chapter
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1054)

Keywords

Short Path Optimal Policy Knapsack Problem Dependence Graph Short Path Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading (MA), USA, 1974.Google Scholar
  2. 2.
    R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, USA, 1957.Google Scholar
  3. 3.
    R. E. Bellman and S. E. Dreyfus. Applied Dynamic Programming. Princeton University Press, Princeton, USA, 1962.Google Scholar
  4. 4.
    A. J. Bernstein. Analysis of Programs for Parallel Processing. IEEE Transactions on Electronic Computers, 15:757–762, 1966.Google Scholar
  5. 5.
    E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numer. Math., 1:269–271, 1959.CrossRefGoogle Scholar
  6. 6.
    S. E. Dreyfus and A. M. Law. The Art and Theory of Dynamic Programming. Mathematics in Science and Engeneering, Volume 130. Academic Press, New York, USA, 1977.Google Scholar
  7. 7.
    S. Fortune and J. Wyllie. Parallelism in Random Access Machines. In Proceedings of STOC-10, pages 114–118, 1978.Google Scholar
  8. 8.
    M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, USA, 1979.Google Scholar
  9. 9.
    Z. Ghalil and K. Park. Dynamic Programming with Convexity, Concavity and Sparsity. Theoretical Computer Science, pages 49–76, 1992.Google Scholar
  10. 10.
    L. J. Guibas, H. T. Kung, and C. D. Thompson. Direct VLSI Implementation of Combinatorial Algorithms. In Proc. Conf. on Very Large Scale Integration, pages 509–525, 1979.Google Scholar
  11. 11.
    R. M. Karp. Reducibility among Combinatorial Problems. In J. W. Thatcher R. E. Miller, editor, Complexity of Computer Computations, pages 85–103, 1972.Google Scholar
  12. 12.
    V. Kumar, Grama A., A. Gupta, and G. Karypis. Parallel Computing. Benjamin Cummings, Redwood City (CA), USA, 1994.Google Scholar
  13. 13.
    V. Kumar and L. Kanal. The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch-and-Bound. In Search in Artificial Intelligence, Berlin, D, 1988. Springer Verlag.Google Scholar
  14. 14.
    R. E. Ladner. The Circuit Value Problem is Log-space Complete for P. SIGACT News 7, 1:18–20, 1975.CrossRefGoogle Scholar
  15. 15.
    R. E. Larson and J. L. Casti. Principles of Dynamic Programming, Volume 1. Marcel Dekker, New York, USA, 1978.Google Scholar
  16. 16.
    R. E. Larson and J. L. Casti. Principles of Dynamic Programming, Volume 2. Marcel Dekker, New York, USA, 1982.Google Scholar
  17. 17.
    G. J. Li and B. W. Wah. Parallel Processing of Serial Dynamic Programming Problems. In Proceedings COMPSAC 85, pages 81–89, 1985.Google Scholar
  18. 18.
    S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer Implementations. Wiley and Sons, Chichester, UK, 1990.Google Scholar
  19. 19.
    G. L. Miller, V. Ramanchandran, and E. Kaltofen. Efficient Parallel Evaluation of Straight-line Code and Arithmetic Circuits. In Aegean Workshop on Computing VLSI Algorithms and Architectures, ACM EATCS, 1986.Google Scholar
  20. 20.
    G. L. Miller and S.-H. Teng. Dynamic Parallel Complexity of Computational Circuits. In Proceedings of STOC, pages 254–263, 1987.Google Scholar
  21. 21.
    L. G. Mitten. Branch and Bound Methods: General Formulation and Properties. Operations Research, 18:24–34, 1970.Google Scholar
  22. 22.
    S. Schrijver. Theory of Linear and Integer Programming. Wiley and Sons, Chichester, UK, 1984.Google Scholar
  23. 23.
    R. Sedgewick. Algorithms. Addison Wesley, Reading (MA), USA, 1983.Google Scholar
  24. 24.
    D. K. Smith. Dynamic Programming: a Practical Introduction. Mathematics and its Applications. Ellis Horwood, Chichester, UK, 1991.Google Scholar
  25. 25.
    M. Sniedovich. Dynamic Programming. Marcel Dekker, New York, USA, 1992.Google Scholar
  26. 26.
    P. M. Spira. A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time O(N 2 log2 N). SIAM J. Comput., 2:28–32, 1973.CrossRefGoogle Scholar
  27. 27.
    S.-H. Teng. Adaptive Parallel Algorithms for Integral Knapsack Problems. J. of Parallel and Distributed Computing, 8(4):400–406, 1990.CrossRefGoogle Scholar
  28. 28.
    L. G. Valiant, S. Skyum, and S. Berkowitz. Fast Parallel Computation of Polynomials using few Processors. SIAM J. Comput, 12:641–644, 1983.CrossRefGoogle Scholar
  29. 29.
    T. A. Williams and G. P. White. A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N-Node Nonnegative-Distance Networks. J. of the ACM, 20:389–390, 1973.CrossRefGoogle Scholar
  30. 30.
    J. Y. Yen. Finding the Lengths of All Shortest Paths in N-Node Nonnegative-Distance Complete Networks Using N 3/2 Additions and N 3 Comparisons. J. of the ACM, 19:423–424, 1972.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Marc Gengler
    • 1
  1. 1.Laboratoire de l'Informatique du ParallélismeEcole Normale Supérieure de LyonLyon Cedex 07France

Personalised recommendations