An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem

  • Weitian Tong
  • Guohui Lin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8889)


Given a collection of multisets \(\{X_1, X_2, \ldots , X_k\}\) (\(k \ge 2\)) of positive integers, a multiset \(S\) is a common integer partition for them if \(S\) is an integer partition of every multiset \(X_i, 1 \le i \le k\). The minimum common integer partition (\(k\)-MCIP) problem is defined as to find a CIP for \(\{X_1, X_2, \ldots , X_k\}\) with the minimum cardinality. We present a \(\frac{6}{5}\)-approximation algorithm for the \(2\)-MCIP problem, improving the previous best algorithm of ratio \(\frac{5}{4}\) designed in 2006. We then extend it to obtain an absolute \(0.6k\)-approximation algorithm for \(k\)-MCIP when \(k\) is even (when \(k\) is odd, the approximation ratio is \(0.6k+0.4\)).


Approximation Algorithm Bipartite Graph Approximation Ratio Performance Ratio Minimum Cardinality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithm, and Applications. China Machine Press (2005)Google Scholar
  2. 2.
    Andrews, G.: The Theory of Partitions. Addison-Wesley (1976)Google Scholar
  3. 3.
    Andrews, G., Eriksson, K.: The Integer Partitions. Cambridge University Press (2004)Google Scholar
  4. 4.
    Berman, P.: A \(d\)/2 approximation for maximum weight independent set in \(d\)-claw free graphs. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 214–219. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Chen, X., Liu, L., Liu, Z., Jiang, T.: On the minimum common integer partition problem. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 236–247. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Chen, X., Liu, L., Liu, Z., Jiang, T.: On the minimum common integer partition problem. ACM Transactions on Algorithms 5, Article 12 (2008)Google Scholar
  7. 7.
    Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: The assignment of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biololgy and Bioinformatics 2, 302–315 (2005)CrossRefGoogle Scholar
  8. 8.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  9. 9.
    Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters 37, 27–35 (1991)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Woodruff, D.P.: Better approximations for the minimum common integer partition problem. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 248–259. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Zhao, W., Zhang, P., Jiang, T.: A network flow approach to the minimum common integer partition problem. Theoretical Computer Science 369, 456–462 (2006)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations