{"id":"https://openalex.org/W2755613158","doi":"https://doi.org/10.1007/s10589-017-9943-4","title":"The min-cut and vertex separator problem","display_name":"The min-cut and vertex separator problem","publication_year":2017,"publication_date":"2017-09-18","ids":{"openalex":"https://openalex.org/W2755613158","doi":"https://doi.org/10.1007/s10589-017-9943-4","mag":"2755613158"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-017-9943-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-017-9943-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9943-4.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9943-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110526012","display_name":"Fanz Rendl","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Fanz Rendl","raw_affiliation_strings":["Universit\u00e4tsstrasse 65-67, 9020, Klagenfurt, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4tsstrasse 65-67, 9020, Klagenfurt, Austria","institution_ids":["https://openalex.org/I4210166741"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082314475","display_name":"Renata Sotirov","orcid":"https://orcid.org/0000-0002-3298-7255"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Renata Sotirov","raw_affiliation_strings":["Warandelaan 2, 5000 LE, Tilburg, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Warandelaan 2, 5000 LE, Tilburg, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082314475"],"corresponding_institution_ids":[],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":1.9125,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.87650573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"69","issue":"1","first_page":"159","last_page":"187"},"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.9970999956130981,"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.9970999956130981,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9851999878883362,"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/mathematics","display_name":"Mathematics","score":0.7411105036735535},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6984270811080933},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.589332103729248},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5402308702468872},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.49847984313964844},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4519875943660736},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4488178789615631},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4473355710506439},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44053202867507935},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.41803669929504395},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4102633595466614},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3973095715045929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27916190028190613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2123335897922516}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7411105036735535},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6984270811080933},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.589332103729248},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5402308702468872},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.49847984313964844},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4519875943660736},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4488178789615631},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4473355710506439},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44053202867507935},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.41803669929504395},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4102633595466614},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3973095715045929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27916190028190613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2123335897922516},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10589-017-9943-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-017-9943-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9943-4.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire/359787a8-9b63-4e64-a583-7f601ab3abb7","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/359787a8-9b63-4e64-a583-7f601ab3abb7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Rendl, F & Sotirov, R 2018, 'The min-cut and vertex separator problem', Computational Optimization and Applications, vol. 69, no. 1, pp. 159-187. https://doi.org/10.1007/s10589-017-9943-4","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:coopap:v:69:y:2018:i:1:d:10.1007_s10589-017-9943-4","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-017-9943-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10589-017-9943-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-017-9943-4","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs10589-017-9943-4.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2755613158.pdf","grobid_xml":"https://content.openalex.org/works/W2755613158.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W112145047","https://openalex.org/W164303106","https://openalex.org/W1530239534","https://openalex.org/W1595903022","https://openalex.org/W1648726702","https://openalex.org/W1768849904","https://openalex.org/W1964488715","https://openalex.org/W1967802975","https://openalex.org/W1977397354","https://openalex.org/W1978500232","https://openalex.org/W1982180670","https://openalex.org/W1995219632","https://openalex.org/W1995658164","https://openalex.org/W1997631839","https://openalex.org/W1999285709","https://openalex.org/W2011039300","https://openalex.org/W2013153664","https://openalex.org/W2015635922","https://openalex.org/W2029282358","https://openalex.org/W2033852356","https://openalex.org/W2035400420","https://openalex.org/W2038643780","https://openalex.org/W2049143039","https://openalex.org/W2051296280","https://openalex.org/W2063790063","https://openalex.org/W2066459185","https://openalex.org/W2069037000","https://openalex.org/W2076535438","https://openalex.org/W2077688031","https://openalex.org/W2078992232","https://openalex.org/W2099368064","https://openalex.org/W2113679823","https://openalex.org/W2118004951","https://openalex.org/W2118807841","https://openalex.org/W2132687600","https://openalex.org/W2143738202","https://openalex.org/W2146361854","https://openalex.org/W2149344437","https://openalex.org/W2161455936","https://openalex.org/W2171599960","https://openalex.org/W2188609405","https://openalex.org/W2963883456","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1983756092","https://openalex.org/W2381295697","https://openalex.org/W2186864281","https://openalex.org/W2352839224","https://openalex.org/W2371590971","https://openalex.org/W2203098598","https://openalex.org/W1653317167","https://openalex.org/W1989828432","https://openalex.org/W2024017812","https://openalex.org/W2101911765"],"abstract_inverted_index":{"We":[0,28,151],"consider":[1],"graph":[2,141,146],"three-partitions":[3],"with":[4,104,169,175],"the":[5,9,14,21,24,32,62,74,77,84,123,126,136,145],"objective":[6],"of":[7,11,23,31,45,51,61,76,96,107,111,125,135,139,157],"minimizing":[8],"number":[10],"edges":[12],"between":[13,59],"first":[15],"two":[16,148],"partition":[17],"sets":[18],"while":[19],"keeping":[20],"size":[22,98,124],"third":[25],"block":[26],"small.":[27],"review":[29],"most":[30],"existing":[33],"relaxations":[34],"for":[35,94],"this":[36],"min-cut":[37],"problem":[38],"and":[39,64,90],"focus":[40],"on":[41,49,122],"a":[42,56,108,133,140],"new":[43,85],"class":[44],"semidefinite":[46,164],"relaxations,":[47],"based":[48],"matrices":[50],"order":[52,75],"$$2n+1$$":[53],"which":[54],"provide":[55],"good":[57],"compromise":[58],"quality":[60],"bound":[63],"computational":[65],"effort":[66,106],"to":[67,119],"actually":[68],"compute":[69],"it.":[70],"Here,":[71],"n":[72],"is":[73,132],"graph.":[78],"Our":[79],"numerical":[80],"results":[81,168],"indicate":[82],"that":[83,171],"bounds":[86,118,121,170],"are":[87],"quite":[88],"strong":[89],"can":[91,172],"be":[92,173],"computed":[93,174],"graphs":[95],"medium":[97],"(":[99],"$$n":[100],"\\approx":[101],"300$$":[102],")":[103],"reasonable":[105],"few":[109],"minutes":[110],"computation":[112],"time.":[113],"Further,":[114],"we":[115],"exploit":[116],"those":[117],"obtain":[120],"vertex":[127,130,137],"separators.":[128],"A":[129],"separator":[131],"subset":[134],"set":[138],"whose":[142],"removal":[143],"splits":[144],"into":[147],"disconnected":[149],"subsets.":[150],"also":[152],"present":[153],"an":[154],"elegant":[155],"way":[156],"convexifying":[158],"non-convex":[159],"quadratic":[160,179],"problems":[161],"by":[162],"using":[163],"programming.":[165],"This":[166],"approach":[167],"any":[176],"standard":[177],"convex":[178],"programming":[180],"solver.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-09T07:27:16.801131","created_date":"2025-10-10T00:00:00"}