An introduction to parallel dynamic programming
From MaRDI portal
Publication:6560205
DOI10.1007/BFB0027119zbMATH Open1543.68436MaRDI QIDQ6560205FDOQ6560205
Authors: Marc Gengler 
Publication date: 21 June 2024
Combinatorial optimization (90C27) Dynamic programming (90C39) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branch-and-Bound Methods: General Formulation and Properties
- Fast Parallel Computation of Polynomials Using Few Processors
- Title not available (Why is that?)
- Parallelism in random access machines
- The art and theory of dynamic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Shared Memory Computer Display System
- Dynamic programming with convexity, concavity and sparsity
- Title not available (Why is that?)
- Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½ N 3 Additions and N 3 Comparisons
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
- A Note on Yen's Algorithm for Finding the Length of All Shortest Paths in N -Node Nonnegative-Distance Networks
This page was built for publication: An introduction to parallel dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560205)
