An improved approximation algorithm for the minimum common integer partition problem

DOI10.1016/j.ic.2021.104784OpenAlexW4244198405MaRDI QIDQ2051801

Weitian Tong, Guo-Hui 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

zbMATH Keywords

approximation algorithminteger partitionamortized analysisweighted set packing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A network flow approach to the minimum common integer partition problem
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• 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

This page was built for publication: An improved approximation algorithm for the minimum common integer partition problem