{"id":"https://openalex.org/W1965957777","doi":"https://doi.org/10.1137/080729918","title":"A Constant Factor Approximation for Minimum \u03bb-Edge-Connected k-Subgraph with Metric Costs","display_name":"A Constant Factor Approximation for Minimum \u03bb-Edge-Connected k-Subgraph with Metric Costs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1965957777","doi":"https://doi.org/10.1137/080729918","mag":"1965957777"},"language":"en","primary_location":{"id":"doi:10.1137/080729918","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080729918","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/A5103408882","display_name":"MohammadAli Safari","orcid":"https://orcid.org/0009-0002-4286-6454"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"MohammadAli Safari","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103408882"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6277,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.667203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"3","first_page":"1089","last_page":"1102"},"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.9994999766349792,"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.9994999766349792,"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.9919000267982483,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9890999794006348,"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.735692024230957},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7348561882972717},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7347831726074219},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7006518244743347},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5697664022445679},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5099328756332397},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4981057643890381},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.462760865688324},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.459623247385025},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4446509778499603},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4439191520214081},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42663395404815674},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.159621000289917},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11356833577156067}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.735692024230957},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7348561882972717},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7347831726074219},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7006518244743347},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5697664022445679},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5099328756332397},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4981057643890381},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.462760865688324},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.459623247385025},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4446509778499603},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4439191520214081},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42663395404815674},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.159621000289917},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11356833577156067},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080729918","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080729918","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1575625195","https://openalex.org/W1998678640","https://openalex.org/W2079430060","https://openalex.org/W2113939799","https://openalex.org/W2147258429","https://openalex.org/W2161190897","https://openalex.org/W2172955861","https://openalex.org/W2767048380"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W1482551403","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2152074130","https://openalex.org/W2393701947"],"abstract_inverted_index":{"In":[0,155],"the":[1,20,43,56,101,130,141,151,162,169,174,184,190],"-subgraph":[2,131,142,153,185],"problem,":[3,48,176],"we":[4,158],"are":[5,165],"given":[6],"an":[7,134,180],"undirected":[8],"graph":[9],"with":[10,32],"edge":[11,163],"costs":[12,164],"and":[13,17,19,55,83,95,110,139],"two":[14],"positive":[15],"integers":[16],",":[18],"goal":[21],"is":[22,52,63,146,179],"to":[23,195],"find":[24],"a":[25,53,64],"minimum":[26,44,57],"cost":[27,45,58],"simple":[28],"-edge-connected":[29,59],"subgraph":[30,61],"of":[31,100,107],"at":[33],"least":[34],"nodes.":[35],"This":[36,187],"generalizes":[37,189],"several":[38],"classical":[39],"problems,":[40],"such":[41],"as":[42,148,150],"-spanning":[46],"tree":[47],"or":[49],"-MST":[50,175,191],"(which":[51,62],"-subgraph),":[54],"spanning":[60],"-subgraph).":[65],"The":[66],"only":[67],"previously":[68],"known":[69],"results":[70],"on":[71,105],"this":[72,156],"problem":[73,132,143],"[L.":[74],"C.":[75],"Lau,":[76],"J.":[77,87],"S.":[78],"Naor,":[79],"M.":[80,84],"R.":[81],"Salavatipour":[82],"Singh,":[85],"SIAM":[86],"Comput.,":[88],"39":[89],"(2009),":[90],"pp.":[91,126],"1062\u20131087],":[92],"[C.":[93],"Chekuri":[94],"N.":[96],"Korula,":[97],"in":[98,144,173],"Proceedings":[99],"IARCS":[102],"Annual":[103],"Conference":[104],"Foundations":[106],"Software":[108],"Technology":[109],"Theoretical":[111],"Computer":[112],"Science":[113],"(FSTTCS),":[114],"Bangalore,":[115],"India,":[116],"LIPIcs":[117],"2,":[118],"Schloss":[119],"Dagstuhl\u2014Leibniz-Zentrum":[120],"f\u00fcr":[121],"Informatik,":[122],"Dagstuhl,":[123],"Germany,":[124],"2008,":[125],"119\u2013130]":[127],"show":[128,159],"that":[129,140,160],"has":[133],"-approximation":[135,181],"(even":[136],"for":[137,183],"2-node-connectivity)":[138],"general":[145],"almost":[147],"hard":[149],"densest":[152],"problem.":[154,186],"paper":[157],"if":[161],"metric":[166],"(i.e.,":[167],"satisfy":[168],"triangle":[170],"inequality),":[171],"like":[172],"then":[177],"there":[178],"algorithm":[182],"essentially":[188],"constant":[192],"factor":[193],"approximability":[194],"higher":[196],"connectivity.":[197]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}