{"id":"https://openalex.org/W2112306992","doi":"https://doi.org/10.1137/s0895480104445095","title":"The Steiner k-Cut Problem","display_name":"The Steiner k-Cut Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2112306992","doi":"https://doi.org/10.1137/s0895480104445095","mag":"2112306992"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480104445095","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480104445095","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Lucent"],"affiliations":[{"raw_affiliation_string":"Lucent","institution_ids":["https://openalex.org/I1322087612"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I1322087612"],"apc_list":null,"apc_paid":null,"fwci":0.337,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.63316383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"1","first_page":"261","last_page":"271"},"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.9995999932289124,"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.9995999932289124,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9864000082015991,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8402858972549438},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8396608829498291},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.837498664855957},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7712893486022949},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6977975368499756},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6244089603424072},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6003393530845642},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5356684923171997},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5139922499656677},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.45724084973335266},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4550503194332123}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8402858972549438},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8396608829498291},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.837498664855957},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7712893486022949},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6977975368499756},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6244089603424072},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6003393530845642},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5356684923171997},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5139922499656677},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45724084973335266},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4550503194332123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0895480104445095","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480104445095","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.676.9221","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.676.9221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://repository.upenn.edu/cgi/viewcontent.cgi?article%3D1268%26context%3Dcis_papers","raw_type":"text"},{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6292","is_oa":false,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6292","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"published","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1990666952","https://openalex.org/W1993861505","https://openalex.org/W2001139415","https://openalex.org/W2026838540","https://openalex.org/W2086565575","https://openalex.org/W2104823067","https://openalex.org/W2122466336","https://openalex.org/W2152986618","https://openalex.org/W2167236203","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2506642202","https://openalex.org/W2611804663","https://openalex.org/W3009415557","https://openalex.org/W3121576764","https://openalex.org/W4246185962"],"related_works":["https://openalex.org/W2115772827","https://openalex.org/W2068595367","https://openalex.org/W4235911878","https://openalex.org/W3210180238","https://openalex.org/W25104710","https://openalex.org/W2170923533","https://openalex.org/W115807216","https://openalex.org/W2005944337","https://openalex.org/W4286890193","https://openalex.org/W1974139762"],"abstract_inverted_index":{"We":[0,74,100],"consider":[1],"the":[2,9,13,48,80,102,105,114],"Steiner":[3,18],"k-cut":[4,10,19,120],"problem":[5,11,20,118,121],"which":[6,68],"generalizes":[7],"both":[8],"and":[12,42,89],"multiway":[14],"cut":[15,117],"problem.":[16],"The":[17],"is":[21,50],"defined":[22],"as":[23],"follows.":[24],"Given":[25],"an":[26,43,109],"edge-weighted":[27],"undirected":[28],"graph":[29],"$G=(V,":[30],"E)$,":[31],"a":[32,53,82,90,97],"subset":[33],"of":[34,57,67],"vertices":[35],"$X":[36],"\\subseteq":[37],"V$":[38],"called":[39],"{\\em":[40],"terminals},":[41],"integer":[44],"$k":[45],"\\le":[46],"|X|$,":[47],"objective":[49],"to":[51,107],"find":[52],"minimum":[54,116],"weight":[55],"set":[56],"edges":[58],"whose":[59],"removal":[60],"results":[61],"in":[62],"k":[63],"disconnected":[64],"components,":[65],"each":[66],"contains":[69],"at":[70],"least":[71],"one":[72],"terminal.":[73],"give":[75],"two":[76],"approximation":[77],"algorithms":[78],"for":[79,113],"problem:":[81],"greedy":[83],"$(2-\\frac{2}{k})$-approximation":[84],"based":[85,94],"on":[86,95],"Gomory--Hu":[87],"trees,":[88],"$(2":[91],"-":[92],"\\frac{2}{|X|})$-approximation":[93],"rounding":[96,106],"linear":[98],"program.":[99],"use":[101],"insight":[103],"from":[104],"develop":[108],"exact":[110],"bidirected":[111],"formulation":[112],"global":[115],"(the":[119],"with":[122],"$k=2$).":[123]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}