An improved approximation algorithm for the minimum common integer partition problem

DOI10.1007/978-3-319-13075-0_28MaRDI QIDQ2942641zbMATH OpenOpenAlexFDO

Authors Weitian Tong, Guohui Lin

Publication date 11 September 2015

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13075-0_28

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Approximation algorithms (68W25)

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

Cited in

(8)

• An improved approximation algorithm for the minimum common integer partition problem
• Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
• On the Minimum Common Integer Partition Problem
• Better Approximations for 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
• A network flow approach to 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 Q2942641)