Better Approximations for the Minimum Common Integer Partition Problem

DOI10.1007/11830924_24MaRDI QIDQ3595391zbMATH OpenOpenAlexFDO

Authors David P. Woodruff

Publication date 28 August 2007

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11830924_24

zbMATH Keywords

approximation algorithmscomputational biologyminimum common integer partition problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20)

Recommendations

• 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
• Approximation Algorithms for the Minimum Convex Partition Problem
• Minimum common string partition problem: hardness and approximations
• Algorithms and Computation
• On the complexity of the minimum independent set partition problem
• A network flow approach to the minimum common integer partition problem
• Improved Approximation Algorithms for Tverberg Partitions

Cited in

(6)

• An improved approximation algorithm for the minimum common integer partition problem
• 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
• On the Minimum Common Integer Partition Problem
• On the minimum common integer partition problem
• A network flow approach to the minimum common integer partition problem

This page was built for publication: Better Approximations for 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 Q3595391)