{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/7891a7dd-3ded-4c07-bf2b-a133c45b893d\" width=\"1280\" height=\"480\" title=\"Scheduling with Mandatory Breaks: NP-Hardness and an Additive-One Approximation — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://montaan.com/","thumbnail_url":"https://montaan.com/media/episodes/7891a7dd-3ded-4c07-bf2b-a133c45b893d/episode.poster.webp","title":"Scheduling with Mandatory Breaks: NP-Hardness and an Additive-One Approximation","type":"rich","version":"1.0","width":1280}