Matching with sizes (or scheduling with processing set restrictions)

Matching problems on bipartite graphs where the entities on one side may have different sizes are intimately related to scheduling problems with processing set restrictions. We survey the close relationship between these two problems, and give new approximation algorithms for the (NP-hard) variation...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 164; pp. 61 - 67
Main Authors:	Biró, Péter, McDermid, Eric
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 19.02.2014
Subjects:	Additives Algorithms Approximation Approximation algorithms Computational complexity Constrictions Couples Errors Hospitals/Residents problem Matching Mathematical analysis Processing set restrictions Scheduling Approximation algorithms Hospitals/Residents problem Scheduling Couples Computational complexity Processing set restrictions
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!