An improved approximation algorithm for the minimum common integer partition problem
From MaRDI portal
Publication:2051801
Recommendations
- An improved approximation algorithm for the minimum common integer partition problem
- On the minimum common integer partition problem
- Better Approximations for the Minimum Common Integer Partition Problem
- On the Minimum Common Integer Partition Problem
- A network flow approach to the minimum common integer partition problem
Cites work
- scientific article; zbMATH DE number 1617260 (Why is no real title available?)
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- A network flow approach to the minimum common integer partition problem
- Better Approximations for the Minimum Common Integer Partition Problem
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
- Introduction to algorithms
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- On the Minimum Common Integer Partition Problem
- On the minimum common integer partition problem
Cited in
(7)- An improved approximation algorithm for the minimum common integer partition problem
- A network flow approach to the minimum common integer partition problem
- On the minimum common integer partition problem
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
- On the Minimum Common Integer Partition Problem
- Better Approximations for the Minimum Common Integer Partition Problem
This page was built for publication: An improved approximation algorithm for the minimum common integer partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051801)