An improved approximation algorithm for the minimum common integer partition problem
From MaRDI portal
Publication:2051801
DOI10.1016/J.IC.2021.104784OpenAlexW4244198405MaRDI QIDQ2051801FDOQ2051801
Authors: Weitian Tong, Guohui Lin
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104784
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
- Introduction to algorithms
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
- On the Minimum Common Integer Partition Problem
- A network flow approach to the minimum common integer partition problem
- On the minimum common integer partition problem
- Better Approximations for 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)