This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading (MA), USA, 1974.
R. E. Bellman. Dynamic Programming. Princeton University Press, Princeton, USA, 1957.
R. E. Bellman and S. E. Dreyfus. Applied Dynamic Programming. Princeton University Press, Princeton, USA, 1962.
A. J. Bernstein. Analysis of Programs for Parallel Processing. IEEE Transactions on Electronic Computers, 15:757–762, 1966.
E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numer. Math., 1:269–271, 1959.
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.
S. Fortune and J. Wyllie. Parallelism in Random Access Machines. In Proceedings of STOC-10, pages 114–118, 1978.
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.
Z. Ghalil and K. Park. Dynamic Programming with Convexity, Concavity and Sparsity. Theoretical Computer Science, pages 49–76, 1992.
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.
R. M. Karp. Reducibility among Combinatorial Problems. In J. W. Thatcher R. E. Miller, editor, Complexity of Computer Computations, pages 85–103, 1972.
V. Kumar, Grama A., A. Gupta, and G. Karypis. Parallel Computing. Benjamin Cummings, Redwood City (CA), USA, 1994.
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.
R. E. Ladner. The Circuit Value Problem is Log-space Complete for P. SIGACT News 7, 1:18–20, 1975.
R. E. Larson and J. L. Casti. Principles of Dynamic Programming, Volume 1. Marcel Dekker, New York, USA, 1978.
R. E. Larson and J. L. Casti. Principles of Dynamic Programming, Volume 2. Marcel Dekker, New York, USA, 1982.
G. J. Li and B. W. Wah. Parallel Processing of Serial Dynamic Programming Problems. In Proceedings COMPSAC 85, pages 81–89, 1985.
S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer Implementations. Wiley and Sons, Chichester, UK, 1990.
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.
G. L. Miller and S.-H. Teng. Dynamic Parallel Complexity of Computational Circuits. In Proceedings of STOC, pages 254–263, 1987.
L. G. Mitten. Branch and Bound Methods: General Formulation and Properties. Operations Research, 18:24–34, 1970.
S. Schrijver. Theory of Linear and Integer Programming. Wiley and Sons, Chichester, UK, 1984.
R. Sedgewick. Algorithms. Addison Wesley, Reading (MA), USA, 1983.
D. K. Smith. Dynamic Programming: a Practical Introduction. Mathematics and its Applications. Ellis Horwood, Chichester, UK, 1991.
M. Sniedovich. Dynamic Programming. Marcel Dekker, New York, USA, 1992.
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.
S.-H. Teng. Adaptive Parallel Algorithms for Integral Knapsack Problems. J. of Parallel and Distributed Computing, 8(4):400–406, 1990.
L. G. Valiant, S. Skyum, and S. Berkowitz. Fast Parallel Computation of Polynomials using few Processors. SIAM J. Comput, 12:641–644, 1983.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gengler, M. (1996). An introduction to parallel dynamic programming. In: Ferreira, A., Pardalos, P. (eds) Solving Combinatorial Optimization Problems in Parallel. Lecture Notes in Computer Science, vol 1054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027119
Download citation
DOI: https://doi.org/10.1007/BFb0027119
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61043-4
Online ISBN: 978-3-540-49875-9
eBook Packages: Springer Book Archive