{"type":"rich","description":"2014\u5e74\u306b\u306a\u3063\u3066\u304b\u3089\u3060\u3044\u3076\u7d4c\u3061\u307e\u3057\u305f\u304c2013\u5e74\u306e\u9032\u6357\u3092\u632f\u308a\u8fd4\u308d\u3046\u304b\u3068\u601d\u3044\u307e\u3059\uff0e \u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u30b3\u30f3\u30c6\u30b9\u30c8\u7d61\u307f\u306e\u3053\u3068\u306fTopCoder\u90e8\u306e\u65b9\u306b\u66f8\u3044\u305f\u306e\u3067\u305d\u3063\u3061\u3092\u5fa1\u89a7\u304f\u3060\u3055\u3044\uff0e \u5352\u8ad6\u306e\u6210\u679c\u3092\u30b8\u30e3\u30fc\u30ca\u30eb\u306b\u51fa\u3057\u305f Kusumoto Mitsuru, Yuichi Yoshida, and Hiro Ito. Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs. (IJNC'13) \u5352\u8ad6\u306e\u6210\u679c\u3092IJNC\u3068\u3044\u3046\u30b8\u30e3\u30fc\u30ca\u30eb\u306b\u6295\u7a3f\u3057\u3066\uff0c\u4f55\u5ea6\u304b\u306e\u4fee\u6b63\u3092\u7d4c\u3066\u53ce\u9332\u3055\u308c\u307e\u3057\u305f\uff0e\u3053\u3053\u306b\u6295\u7a3f\u2026","published":"2014-01-17 20:36:44","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fir5.hatenablog.com%2Fentry%2F20140117%2F1389958604\" title=\"2013\u5e74\u3092\u4eca\u66f4\u632f\u308a\u8fd4\u308b - \u3046\u3069\u3093\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","author_name":"ir5","image_url":null,"provider_name":"Hatena Blog","version":"1.0","blog_title":"\u3046\u3069\u3093\u8a18","height":"190","categories":[],"title":"2013\u5e74\u3092\u4eca\u66f4\u632f\u308a\u8fd4\u308b","url":"https://ir5.hatenablog.com/entry/20140117/1389958604","blog_url":"https://ir5.hatenablog.com/","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/ir5/"}