A note on “An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs”

Authors:
Kangbok Lee;Joseph Y. -T. Leung;Michael L. Pinedo
Affiliations:
Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA;Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Information, Operations & Management Sciences, Stern School of Business, New York University, 44 West 4th Street, New York, NY 10012-1126, USA
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 1

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
The competitiveness of on-line assignments

Journal of Algorithms
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs

Information Processing Letters
Graph balancing: a special case of scheduling unrelated parallel machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
An optimal rounding gives a better approximation for scheduling unrelated machines

Operations Research Letters

Faster algorithms for semi-matching problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

We point out an error in the algorithm for the Load Balanced Semi-Matching Problem presented by C.P. Low [C.P. Low, An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs, Information Processing Letters 100 (2006) 154-161]. This problem is equivalent to a parallel machine scheduling problem subject to eligibility constraints, in which each job has a pre-determined set of machines capable of processing the job.