On the minimum common integer partition problem

DOI10.1145/1435375.1435387zbMath1445.90090OpenAlexW2152018213MaRDI QIDQ4962770

Tao Jiang, Xin Chen, Zheng Liu, Lan Liu

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1435375.1435387

zbMATH Keywords

combinatorial optimizationapproximation algorithmcomputational biologyNP-hardnessinteger partitionsubset sum

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Kernelization and parameterized algorithms for covering a tree by a set of stars or paths ⋮ Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition ⋮ An improved approximation algorithm for the minimum common integer partition problem

This page was built for publication: On the minimum common integer partition problem