{"id":"https://openalex.org/W4200046623","doi":"https://doi.org/10.23919/cnsm52442.2021.9615583","title":"A Greedy Algorithm for Minimum Cut into Bounded Sets Problem","display_name":"A Greedy Algorithm for Minimum Cut into Bounded Sets Problem","publication_year":2021,"publication_date":"2021-10-25","ids":{"openalex":"https://openalex.org/W4200046623","doi":"https://doi.org/10.23919/cnsm52442.2021.9615583"},"language":"en","primary_location":{"id":"doi:10.23919/cnsm52442.2021.9615583","is_oa":false,"landing_page_url":"https://doi.org/10.23919/cnsm52442.2021.9615583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 17th International Conference on Network and Service Management (CNSM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056318001","display_name":"Onur U\u011furlu","orcid":"https://orcid.org/0000-0003-2743-5939"},"institutions":[{"id":"https://openalex.org/I132257509","display_name":"Izmir University","ror":"https://ror.org/013h3xr51","country_code":"TR","type":"education","lineage":["https://openalex.org/I132257509"]},{"id":"https://openalex.org/I4387152504","display_name":"Bak\u0131r\u00e7ay \u00dcniversitesi","ror":"https://ror.org/017v96566","country_code":null,"type":"education","lineage":["https://openalex.org/I4387152504"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Onur Ugurlu","raw_affiliation_strings":["Department of Fundamental Sciences, Izmir Bakircay University, Izmir, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Fundamental Sciences, Izmir Bakircay University, Izmir, Turkey","institution_ids":["https://openalex.org/I132257509","https://openalex.org/I4387152504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029482358","display_name":"Vahid Khalilpour Akram","orcid":"https://orcid.org/0000-0002-4082-6419"},"institutions":[{"id":"https://openalex.org/I41641357","display_name":"Ege University","ror":"https://ror.org/02eaafc18","country_code":"TR","type":"education","lineage":["https://openalex.org/I41641357"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Vahid Khalilpour Akram","raw_affiliation_strings":["International Computer Institute Ege University, Izmir, Turkey"],"affiliations":[{"raw_affiliation_string":"International Computer Institute Ege University, Izmir, Turkey","institution_ids":["https://openalex.org/I41641357"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022619959","display_name":"Deniz T\u00fcrsel Eliiyi","orcid":"https://orcid.org/0000-0001-7693-3980"},"institutions":[{"id":"https://openalex.org/I132257509","display_name":"Izmir University","ror":"https://ror.org/013h3xr51","country_code":"TR","type":"education","lineage":["https://openalex.org/I132257509"]},{"id":"https://openalex.org/I4387152504","display_name":"Bak\u0131r\u00e7ay \u00dcniversitesi","ror":"https://ror.org/017v96566","country_code":null,"type":"education","lineage":["https://openalex.org/I4387152504"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Deniz Tursel Eliiyi","raw_affiliation_strings":["Department of Industrial Engineering, Izmir Bakircay University, Izmir, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Izmir Bakircay University, Izmir, Turkey","institution_ids":["https://openalex.org/I132257509","https://openalex.org/I4387152504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056318001"],"corresponding_institution_ids":["https://openalex.org/I132257509","https://openalex.org/I4387152504"],"apc_list":null,"apc_paid":null,"fwci":0.148,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54330821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"422","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8186914920806885},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.7162362337112427},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6208261251449585},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5351620316505432},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5011014938354492},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4519292712211609},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.44717714190483093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4348660111427307},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42199212312698364},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40940341353416443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3733707666397095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33244839310646057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13870781660079956}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8186914920806885},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.7162362337112427},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6208261251449585},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5351620316505432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5011014938354492},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4519292712211609},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.44717714190483093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4348660111427307},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42199212312698364},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40940341353416443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3733707666397095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33244839310646057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13870781660079956},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/cnsm52442.2021.9615583","is_oa":false,"landing_page_url":"https://doi.org/10.23919/cnsm52442.2021.9615583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 17th International Conference on Network and Service Management (CNSM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1525900367","https://openalex.org/W1847903816","https://openalex.org/W1999602503","https://openalex.org/W2019615117","https://openalex.org/W2057463094","https://openalex.org/W2071733767","https://openalex.org/W2076486289","https://openalex.org/W2118382442","https://openalex.org/W2121204510","https://openalex.org/W2128113881","https://openalex.org/W2168919539","https://openalex.org/W3004842270","https://openalex.org/W4213060883","https://openalex.org/W6638734688"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2903538031","https://openalex.org/W1827895227","https://openalex.org/W2129497110","https://openalex.org/W2115772827","https://openalex.org/W2942946217","https://openalex.org/W2078695342","https://openalex.org/W1588356204"],"abstract_inverted_index":{"Finding":[0,81],"critical":[1,23,40,94],"links":[2,41,95],"and":[3,105,136],"weak":[4],"points":[5],"is":[6,52,115,152],"an":[7,116],"important":[8,93],"task":[9],"in":[10,48,57,78,96],"almost":[11],"all":[12],"types":[13],"of":[14,30,45,76,146],"networks.":[15,142],"Minimum":[16],"cuts":[17],"provide":[18,34,89],"useful":[19,90],"information":[20,38,91],"about":[21],"the":[22,43,49,65,74,82,144,149,153,157],"links.":[24],"However,":[25],"finding":[26],"a":[27,31,97,103,122],"minimum":[28,66,83,109,158],"cut":[29,67,84,110,159],"network":[32,51],"may":[33],"insufficient":[35],"or":[36],"misleading":[37],"on":[39,92,140],"since":[42],"number":[44,75],"disconnected":[46],"nodes":[47,77],"residual":[50],"not":[53],"taken":[54],"into":[55,68,85,111,160],"account":[56],"this":[58,61,126],"problem.":[59,119,163],"In":[60],"work,":[62],"we":[63],"study":[64],"bounded":[69,86,112,161],"sets":[70,87,113,162],"problem,":[71],"which":[72],"limits":[73],"portioned":[79],"sets.":[80],"can":[88],"different":[98],"network,":[99],"whose":[100],"failure":[101],"has":[102],"hard":[104],"unacceptable":[106],"effect.":[107],"The":[108],"problem":[114,127],"open":[117],"NP-Complete":[118],"We":[120],"propose":[121],"greedy":[123],"algorithm":[124,151],"for":[125,156],"with":[128],"<tex":[129],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[130],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O\\left(c":[131],"\\times":[132],"n^{2}\\right)$</tex>":[133],"time":[134],"complexity":[135],"present":[137],"computational":[138],"results":[139],"random":[141],"To":[143],"best":[145],"our":[147],"knowledge,":[148],"proposed":[150],"first":[154],"heuristic":[155]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}