A network flow approach to the minimum common integer partition problem

DOI10.1016/J.TCS.2006.09.001zbMATH Open1140.68073OpenAlexW2042185358MaRDI QIDQ861289FDOQ861289

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

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

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)

Cites Work

• Introduction to algorithms
• Optimization, approximation, and complexity classes
• Title not available (Why is that?)
• On the Minimum Common Integer Partition Problem
• A Parsimony Approach to Genome-Wide Ortholog Assignment

Cited In (6)

• An improved approximation algorithm for the minimum common integer partition problem
• An improved approximation algorithm for the minimum common integer partition problem
• On the minimum common integer partition problem
• 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

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)