Skip to main content
SpringerLink
Log in

Min-max partitioning problem with matroid constraint

  • Published:
Journal of Zhejiang University-SCIENCE A Aims and scope Submit manuscript

Abstract

In this paper, we consider the set partitioning problem with matroid constraint, which is a generation of the k-partitioning problem. The objective is to minimize the weight of the heaviest subset. We present an approximation algorithm, which consists of two sub-algorithms—the modified Edmonds’ matroid partitioning algorithm and the exchange algorithm, for the problem. An estimation of the worst ratio for the algorithm is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Babel, L., Kellerer, H., Kotov, V., 1998. The k-partitioning problem. Math. Methods Oper. Res., 47(1):59–82. [doi:10.1007/BF01193837]

    Article  MathSciNet  MATH  Google Scholar 

  • Burkard, R.E., Yao, E.Y., 1990. Constrained partitioning problems. Discr. Appl. Math., 28(1):21–34. [doi:10.1016/0166-218X(90)90091-P]

    Article  MathSciNet  MATH  Google Scholar 

  • Edmonds, J., 1965. Minimum partition of a matroid into independent subsets. J. Res. NBS, 69B:67–72.

    MathSciNet  MATH  Google Scholar 

  • Garey, M.R., Johnson, D.S., 1978. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA.

    MATH  Google Scholar 

  • Graham, R.L., 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math., 17(2):416–429. [doi:10.1137/0117039]

    Article  MathSciNet  MATH  Google Scholar 

  • Hwang, F.K., 1981. Optimal partitions. J. Opt. Theory Appl., 34(1):1–10. [doi:10.1007/BF00933355]

    Article  MathSciNet  MATH  Google Scholar 

  • Hwang, F.K., Sun, J., Yao, E.Y., 1985. Optimal set partitioning. J. Algebr. Methods, 6(1):163–170. [doi:10.1137/0606015]

    MathSciNet  MATH  Google Scholar 

  • Lawler, E.L., 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston.

  • Lee, C.Y., Liman, S.D., 1993. Capacitated two-parallel machines scheduling to minimize sum of job completion times. Discr. Appl. Math., 41(3):211–222. [doi:10.1016/0166-218X(90)90055-H]

    Article  MathSciNet  MATH  Google Scholar 

  • Welsh, D.J.A., 1976. Matroid Theory. Academic Press, London.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang University, Hangzhou, 310027, China

    Biao Wu & En-yu Yao

Authors
  1. Biao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. En-yu Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Biao Wu.

Additional information

Project (No. 10671177) supported by the National Natural Science Foundation of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, B., Yao, Ey. Min-max partitioning problem with matroid constraint. J. Zhejiang Univ. Sci. A 9, 1446–1450 (2008). https://doi.org/10.1631/jzus.A071606

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.A071606

Key words

Document code

CLC number

Search

Navigation