Least-cost partition algorithms

DOI10.1016/0166-218X(88)90097-2zbMath0679.90088OpenAlexW2083462149WikidataQ126863030 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

zbMATH Keywords

knapsack problemaverage-case complexityleast-cost partition problemworst-cost complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial aspects of partitions of integers (05A17) Dynamic programming (90C39)

Related Items (1)

Least-cost partition algorithms

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

This page was built for publication: Least-cost partition algorithms