A note on the average-case behavior of a simple differencing method for partitioning
From MaRDI portal
Recommendations
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
- scientific article; zbMATH DE number 1962846
- Randomized methods for the number partitioning problem
- Probabilistic analysis of optimum partitioning
- Computer-assisted proof of performance ratios for the differencing method
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
- Probabilistic analysis of optimum partitioning
Cited in
(9)- scientific article; zbMATH DE number 2230249 (Why is no real title available?)
- Performance ratios of the Karmarkar-Karp differencing method
- Computer-assisted proof of performance ratios for the differencing method
- A note on the complexity of a partition algorithm
- scientific article; zbMATH DE number 1962846 (Why is no real title available?)
- Algorithmic obstructions in the random number partitioning problem
- The modified differencing method for the set partitioning problem with cardinality constraints
- Worst-case analysis of the differencing method for the partition problem
- Probabilistic analysis of optimum partitioning
This page was built for publication: A note on the average-case behavior of a simple differencing method for partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095035)
