{"type":"rich","version":1.0,"provider_name":"Speaker Deck","provider_url":"https://speakerdeck.com/","title":"O(log n)-Approximation Algorithms for Bipartiteness Ratio","author_name":"Tasuku Soma","author_url":"https://speakerdeck.com/tasusu","html":"\u003ciframe id=\"talk_frame_1555655\" class=\"speakerdeck-iframe\" src=\"https://speakerdeck.com/player/98a17cdd9d8b453e9786f30450c7bd0e\" width=\"710\" height=\"399\" style=\"aspect-ratio:710/399; border:0; padding:0; margin:0; background:transparent;\" frameborder=\"0\" allowtransparency=\"true\" allowfullscreen=\"allowfullscreen\"\u003e\u003c/iframe\u003e\n","width":710,"height":399,"ratio":1.7784313725490195}