Pareto optimal matchings of students to courses in the presence of prerequisites

Katarína Cechlárová, Bettina Klaus, David F. Manlove
2018 Discrete Optimization  
time for lexicographic preferences. In the latter case, the problem of finding a maximum cardinality POM is NP-hard and very difficult to approximate.
doi:10.1016/j.disopt.2018.04.004 fatcat:g7lwc6n37ve2zaesbqtz2owjyy