A network flow approach to the minimum common integer partition problem

DOI10.1016/J.TCS.2006.09.001MaRDI QIDQ861289zbMATH OpenOpenAlexFDO

Authors Peng Zhang, Tao Jiang, Wen-Bo Zhao

Publication date 9 January 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.09.001

zbMATH Keywords

approximation algorithmnetwork flowminimum common integer partition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Partitions of sets (05A18)

Recommendations

• Better Approximations for the Minimum Common Integer Partition Problem
• On the minimum common integer partition problem
• On the Minimum Common Integer Partition Problem
• An improved approximation algorithm for the minimum common integer partition problem
• An improved approximation algorithm for the minimum common integer partition problem

Cites work

• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A Parsimony Approach to Genome-Wide Ortholog Assignment
• Introduction to algorithms
• On the Minimum Common Integer Partition Problem
• Optimization, approximation, and complexity classes

Cited in

(6)

• On the minimum common integer partition problem
• Better Approximations for the Minimum Common Integer Partition Problem
• Fast, flexible, and exact minimum flow decompositions via ILP
• On the Minimum Common Integer Partition Problem
• An improved approximation algorithm for the minimum common integer partition problem
• An improved approximation algorithm for the minimum common integer partition problem

This page was built for publication: A network flow approach to 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 Q861289)