2 papers
cs.DS2024
Simple approximation algorithms for Polyamorous Scheduling
Yuriy Biktairov, Leszek Gąsieniec, Wanchote Po Jiamjitrak +3
In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time betwee…
cs.DS2024
Polyamorous Scheduling
Leszek Gąsieniec, Benjamin Smith, Sebastian Wild
Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationship…