Advertisement

On Load-Balanced Semi-matchings for Weighted Bipartite Graphs

  • Chor Ping Low
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)

Abstract

A semi-matching on a bipartite graph G=(UV, E) is a set of edges X ⊆ E such that each vertex in U is incident to exactly one edge in X. The sum of the weights of the vertices from U that are assigned (semi-matched) to some vertex vV is referred to as the load of vertex v. In this paper, we consider the problem to finding a semi-matching that minimizes the maximum load among all vertices in V. This problem has been shown to be solvable in polynomial time by Harvey et. al [3] and Fakcharoenphol et. al [5] for unweighted graphs. However, the computational complexity for the weighted version of the problem was left as an open problem. In this paper, we prove that the problem of finding a semi-matching that minimizes the maximum load among all vertices in a weighted bipartite graph is NP-complete. A \(\frac{3}{2}\)-approximation algorithm is proposed for this problem.

Keywords

semi-matching bipartite graphs load balancing NP-hard approximation algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall Inc., Englewood Cliffs (1993)Google Scholar
  2. Hopcroft, J.E., Karp, R.M.: An n2.5 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  3. Harvey, N., Ladner, R., Lovasz, L., Tamir, T.: Semi-matchings for bipartite graphs and load balancing. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 284–306. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. Low, C.P.: An efficient retrival selection algorithm for video servers with random duplicated assignment storage technique. Information Processing Letters 83, 315–321 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  5. Fakcharoenphol, J., Lekhanukit, B., Nanongkai, D.: A faster algorithm for optimal semi-matching, manuscript (2005)Google Scholar
  6. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnoy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5, 287–326 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman company, New York (1979)zbMATHGoogle Scholar
  8. Berge, C.: Two theorems in graph theory. Proc. Nat. Acad. Sci. 43, 842–844 (1957)zbMATHCrossRefMathSciNetGoogle Scholar
  9. Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46, 259–271 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  10. Shchepin, E.V., Vakhania, N.V.: Task distributions on multiprocessor systems. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 112–125. Springer, Heidelberg (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Chor Ping Low
    • 1
  1. 1.School of Electrical and Electronic EngineeringNanyang Technological UniversitySingapore

Personalised recommendations