A Greedy Algorithm for Minimum Cut into Bounded Sets Problem

Basit Öğe Kaydı
dc.contributor.authorUgurlu, Onur
dc.contributor.authorAkram, Vahid Khalilpour
dc.contributor.authorEliiyi, Deniz Tursel
dc.date.accessioned2023-03-22T19:47:16Z
dc.date.available2023-03-22T19:47:16Z
dc.date.issued2021
dc.departmentBelirleneceken_US
dc.description17th International Conference on Network and Service Management (CNSM) - Smart Management for Future Networks and Services -- OCT 25-29, 2021 -- ELECTR NETWORKen_US
dc.description.abstractFinding critical links and weak points is an important task in almost all types of networks. Minimum cuts provide useful information about the critical links. However, finding a minimum cut of a network may provide insufficient or misleading information on critical links since the number of disconnected nodes in the residual network is not taken into account in this problem. In this work, we study the minimum cut into bounded sets problem, which limits the number of nodes in portioned sets. Finding the minimum cut into bounded sets can provide useful information on important critical links in a different network, whose failure has a hard and unacceptable effect. The minimum cut into bounded sets problem is an open NP-Complete problem. We propose a greedy algorithm for this problem with O(c x n(2)) time complexity and present computational results on random networks. To the best of our knowledge, the proposed algorithm is the first heuristic for the minimum cut into bounded sets problem.en_US
dc.description.sponsorshipIEEE,IEEE Commun Soc,IFIP,ACM In Cooperat,FutureWei Technologies,Andasis,Argelaen_US
dc.description.sponsorshipTUBITAK (Scientific and Technical Research Council of Turkey) [121F092]en_US
dc.description.sponsorshipThis research was supported by the TUBITAK (Scientific and Technical Research Council of Turkey) [Project number 121F092].en_US
dc.identifier.endpage426en_US
dc.identifier.isbn978-3-903176-36-2
dc.identifier.issn2165-9605
dc.identifier.scopus2-s2.0-85123432228en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage422en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14034/580
dc.identifier.wosWOS:000836226700069en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.journalProceedings Of The 2021 17th International Conference On Network And Service Management (Cnsm 2021): Smart Management For Future Networks And Servicesen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectNetwork Connectivityen_US
dc.subjectMinimum Cuten_US
dc.subjectCritical Edgesen_US
dc.subjectHeuristicsen_US
dc.subjectGreedy Algorithmsen_US
dc.titleA Greedy Algorithm for Minimum Cut into Bounded Sets Problemen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu