Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:oasis.postech.ac.kr:2014.oak/36389

A Note on “An Approximation Algorithm for the Load-balanced Semi-matching Problem in Weighted Bipartite Graphs”

Authors
Publication date
29 August 2018
Publisher
ELSEVIER SCIENCE BV
Doi

    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. (c) 2009 Elsevier B.V. All rights reserved.1134sciescopu

    Similar works

    Full text

    thumbnail-image

    포항공과대학교

    redirect
    oaioai:oasis.postech.ac.kr:2014.o...
    Last time updated on 11/02/2018

    This paper was published in 포항공과대학교.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.