Simple approximation algorithms for Polyamorous Scheduling

DOI10.1137/1.9781611978315.23MaRDI QIDQ7292117zbMATH OpenFDO

Authors Yuriy Biktairov, Leszek Gąsieniec, Wanchote Po Jiamjitrak, Kumari Namrata, Benjamin Smith, Sebastian Wild

Publication date 8 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978315.23

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Simple approximation algorithms for Polyamorous Scheduling

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