5 citations · 9 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Moore's Greedy Algorithm for Minimizing the Number of Late Jobs: Structure and Implementation
Dean Matthew Menezes, C. Gregory Plaxton
Scheduling jobs with deadlines and processing times on a single resource to minimize late jobs equates to finding a maximum-cardinality feasible subset. Moore (1968) proposed a…
cs.GT2026
Hospitals/Residents with Inseparable Couples: Finding a Coalition-Stable Assignment Is NP-Hard
Zeyuan Hu, C. Gregory Plaxton
In recent work on course allocation, Rodríguez and Manlove consider the complexity of finding a stable assignment under four notions of stability, including two coalitional notions…