{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:40:30Z","timestamp":1730342430531,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,25]]},"DOI":"10.23919\/cnsm52442.2021.9615583","type":"proceedings-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T20:30:34Z","timestamp":1638477034000},"page":"422-426","source":"Crossref","is-referenced-by-count":1,"title":["A Greedy Algorithm for Minimum Cut into Bounded Sets Problem"],"prefix":"10.23919","author":[{"given":"Onur","family":"Ugurlu","sequence":"first","affiliation":[]},{"given":"Vahid","family":"Khalilpour Akram","sequence":"additional","affiliation":[]},{"given":"Deniz","family":"Tursel Eliiyi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1006\/jagm.1994.1043"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/234533.234534"},{"key":"ref12","first-page":"47","article-title":"Approximating st minimum cuts in õ (n 2) time","author":"bencz\u00far","year":"0","journal-title":"Proc of the Twenty-Eighth Annual ACM Symposium on Theory of Computing"},{"key":"ref13","volume":"87","author":"bodlaender","year":"1987","journal-title":"The maximum cut and minimum cut into bounded sets problems on cographs"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/0095-8956(79)90067-4"},{"key":"ref15","article-title":"Computers and intractability","author":"garey","year":"1979","journal-title":"A Guided Tour"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.3390\/s130708786"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/1298126.1298192"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/263867.263872"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/s00224-007-2010-2"},{"key":"ref8","first-page":"225","article-title":"On the max flow min cut theorem of networks","volume":"38","author":"dantzig","year":"2003","journal-title":"Linear Inequalities and Related Systems"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/j.adhoc.2020.102092"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1155\/2013\/867903"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1137\/0201010"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.4153\/CJM-1956-045-5"}],"event":{"name":"2021 17th International Conference on Network and Service Management (CNSM)","start":{"date-parts":[[2021,10,25]]},"location":"Izmir, Turkey","end":{"date-parts":[[2021,10,29]]}},"container-title":["2021 17th International Conference on Network and Service Management (CNSM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9615441\/9615442\/09615583.pdf?arnumber=9615583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T20:53:48Z","timestamp":1647896028000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9615583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,25]]},"references-count":15,"URL":"https:\/\/doi.org\/10.23919\/cnsm52442.2021.9615583","relation":{},"subject":[],"published":{"date-parts":[[2021,10,25]]}}}