A network flow approach to the minimum common integer partition problem

DOI10.1016/J.TCS.2006.09.001zbMath1140.68073OpenAlexW2042185358MaRDI QIDQ861289

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) Partitions of sets (05A18) Approximation algorithms (68W25)

Related Items (1)

An improved approximation algorithm for the minimum common integer partition problem

Cites Work

• Optimization, approximation, and complexity classes
• On the Minimum Common Integer Partition Problem
• A Parsimony Approach to Genome-Wide Ortholog Assignment
• Unnamed Item
• Unnamed Item

This page was built for publication: A network flow approach to the minimum common integer partition problem