Least-cost partition algorithms
From MaRDI portal
Publication:1823166
DOI10.1016/0166-218X(88)90097-2zbMath0679.90088WikidataQ126863030 ScholiaQ126863030MaRDI QIDQ1823166
Thomas J. jun. Marlowe, Marvin C. Paull
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(88)90097-2
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
05A17: Combinatorial aspects of partitions of integers
90C39: Dynamic programming
Related Items
Cites Work
- Least-cost partition algorithms
- Optimum binary search trees
- Fast Algorithms for Solving Path Problems
- A program data flow analysis procedure
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- The Theory and Computation of Knapsack Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item