The complexity of finding fair many-to-one matchings

From MaRDI portal

(Redirected from Publication:6560813)
The complexity of finding fair many-to-one matchings (scientific article; zbMATH DE number 7870237)

Jump to:navigation, search

DOI10.4230/LIPICS.ICALP.2022.27MaRDI QIDQ6560813zbMATH OpenFDO

Authors Niclas Boehmer, Tomohiro Koana

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.27

zbMATH Keywords

algorithmic fairness color coding FPT graph theory ILP NP-hardness polynomial-time algorithms submodular and supermodular functions

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: The complexity of finding fair many-to-one matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560813)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=The_complexity_of_finding_fair_many-to-one_matchings_(scientific_article;_zbMATH_DE_number_7870237)&oldid=99820472"