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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 164; S. 61 - 67
Hauptverfasser:	Biró, Péter, McDermid, Eric
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 19.02.2014
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!