![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/cnsm/UgurluAE21
@inproceedings{DBLP:conf/cnsm/UgurluAE21, author = {Onur Ugurlu and Vahid Khalilpour Akram and Deniz T{\"{u}}rsel Eliiyi}, editor = {Prosper Chemouil and Mehmet Ulema and Stuart Clayman and M{\"{u}}ge Sayit and Cihat {\c{C}}etinkaya and Stefano Secci}, title = {A Greedy Algorithm for Minimum Cut into Bounded Sets Problem}, booktitle = {17th International Conference on Network and Service Management, {CNSM} 2021, Izmir, Turkey, October 25-29, 2021}, pages = {422--426}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.23919/CNSM52442.2021.9615583}, doi = {10.23919/CNSM52442.2021.9615583}, timestamp = {Sun, 02 Oct 2022 15:57:41 +0200}, biburl = {https://dblp.org/rec/conf/cnsm/UgurluAE21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.