{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:46:56Z","timestamp":1781077616190,"version":"3.54.1"},"reference-count":39,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1137\/20m1383197","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T14:53:01Z","timestamp":1650898381000},"page":"FOCS20-205-FOCS20-238","source":"Crossref","is-referenced-by-count":1,"title":["A Parameterized Approximation Scheme for Min $k$-Cut"],"prefix":"10.1137","volume":"53","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3091-3823","authenticated-orcid":true,"given":"Vaishali","family":"Surianarayanan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/120884857"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_4"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005369"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/070705970"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934508"},{"key":"atypb6","first-page":"321","volume-title":"Proceedings of the 34th International Conference on Machine Learning, D. Precup and Y. W. Teh, eds., Proceedings of Machine Learning Research 70","author":"Backurs A.","year":"2017"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032077"},{"key":"atypb8","volume-title":"Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques","author":"Chlamt\u00e1c E.","year":"2016"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.56"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1145\/3426738"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/19M1299359"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)81014-4"},{"key":"atypb14","volume-title":"Graph Theory","author":"Diestel R.","year":"2012","edition":"4"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335370"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.24"},{"key":"atypb17","volume-title":"CoRR, abs\/2005.08301","author":"Gupta A.","year":"2020"},{"key":"atypb18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00020"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.179"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316395"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384285"},{"key":"atypb23","first-page":"432","volume-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Karger D. R.","year":"1994"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.59"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"atypb26","volume-title":"Algorithm Design","author":"Kleinberg J. M.","year":"2006"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.53"},{"key":"atypb28","first-page":"1077","volume-title":"Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science","author":"Li J.","year":"2019"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"atypb30","first-page":"11","author":"Manurangsi P.","year":"2018","journal-title":"Algorithms"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.007"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"atypb33","first-page":"27","volume-title":"Proceedings of the 12th Annual ACM\/SIAM Symposium on Discrete Algorithms","author":"Naor J.","year":"2001"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492475"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.01.040"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792251730"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90130-R"},{"key":"atypb38","first-page":"166","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"Thorup M.","year":"2008"},{"key":"atypb39","volume-title":"Approximation Algorithms","author":"Vazirani V. V.","year":"2001"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T15:33:26Z","timestamp":1734363206000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1383197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1137\/20M1383197"],"URL":"https:\/\/doi.org\/10.1137\/20m1383197","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,25]]}}}