{"author_name":"Paper Radio","author_url":"https://montaan.com/","height":480,"html":"<iframe src=\"https://montaan.com/embed/episode/dfa6432d-ff20-4a6a-9d30-43ca5ac985d9\" width=\"1280\" height=\"480\" title=\"Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms — 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/dfa6432d-ff20-4a6a-9d30-43ca5ac985d9/episode.poster.webp","title":"Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms","type":"rich","version":"1.0","width":1280}