{"id":"https://openalex.org/W2552587983","doi":"https://doi.org/10.1007/s00224-016-9723-z","title":"Approximation Algorithms for Connected Graph Factors of Minimum Weight","display_name":"Approximation Algorithms for Connected Graph Factors of Minimum Weight","publication_year":2016,"publication_date":"2016-11-16","ids":{"openalex":"https://openalex.org/W2552587983","doi":"https://doi.org/10.1007/s00224-016-9723-z","mag":"2552587983"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-016-9723-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-016-9723-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-016-9723-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"Theory of Computing Systems","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/s00224-016-9723-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012357439","display_name":"Kamiel Cornelissen","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Kamiel Cornelissen","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010930168","display_name":"Ruben Hoeksma","orcid":"https://orcid.org/0000-0002-6553-7242"},"institutions":[{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":true,"raw_author_name":"Ruben Hoeksma","raw_affiliation_strings":["University of Chile, Santiago, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chile, Santiago, Chile","institution_ids":["https://openalex.org/I69737025"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049949046","display_name":"N. S. Narayanaswamy","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"N. S. Narayanaswamy","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109425857","display_name":"C. S. Rahul","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. S. Rahul","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056394593","display_name":"Marten Waanders","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marten Waanders","raw_affiliation_strings":["University of Twente, Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002315999","https://openalex.org/A5010930168","https://openalex.org/A5012357439","https://openalex.org/A5049949046"],"corresponding_institution_ids":["https://openalex.org/I24676775","https://openalex.org/I69737025","https://openalex.org/I94624287"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.6524,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75878428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"62","issue":"2","first_page":"441","last_page":"464"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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/social-connectedness","display_name":"Social connectedness","score":0.8075651526451111},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7237339019775391},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6203835606575012},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6173299551010132},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6039609909057617},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5405572652816772},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5398404598236084},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5241782069206238},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4603983461856842},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4251245856285095},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4228248596191406},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4203697741031647},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.41950419545173645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3035176694393158},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24954724311828613}],"concepts":[{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.8075651526451111},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7237339019775391},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6203835606575012},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6173299551010132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6039609909057617},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5405572652816772},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5398404598236084},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5241782069206238},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4603983461856842},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4251245856285095},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4228248596191406},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4203697741031647},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.41950419545173645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3035176694393158},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24954724311828613},{"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/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00224-016-9723-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-016-9723-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-016-9723-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/5ada72ec-1f20-46f4-8a5b-c0665e68e1d3","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/5ada72ec-1f20-46f4-8a5b-c0665e68e1d3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cornelissen, K, Hoeksma, R, Manthey, B, Narayanaswamy, N S, Rahul, C S & Waanders, M 2018, 'Approximation Algorithms for Connected Graph Factors of Minimum Weight', Theory of computing systems, vol. 62, no. 2, pp. 441-464. https://doi.org/10.1007/s00224-016-9723-z","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:repositorio.uchile.cl:2250/150473","is_oa":true,"landing_page_url":"http://repositorio.uchile.cl/handle/2250/150473","pdf_url":null,"source":{"id":"https://openalex.org/S4306481413","display_name":"Universidad de Chile","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory of Computing Systems","raw_type":"Art\u00edculo de revista"}],"best_oa_location":{"id":"doi:10.1007/s00224-016-9723-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-016-9723-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-016-9723-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321015","display_name":"University of Twente","ror":"https://ror.org/006hf6230"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2552587983.pdf","grobid_xml":"https://content.openalex.org/works/W2552587983.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W140130170","https://openalex.org/W1479863711","https://openalex.org/W1714357736","https://openalex.org/W1746024445","https://openalex.org/W1899379166","https://openalex.org/W1957572500","https://openalex.org/W1986011879","https://openalex.org/W2004163233","https://openalex.org/W2011039300","https://openalex.org/W2020163691","https://openalex.org/W2038225707","https://openalex.org/W2052113818","https://openalex.org/W2058605762","https://openalex.org/W2076040942","https://openalex.org/W2079430060","https://openalex.org/W2092113566","https://openalex.org/W2114554145","https://openalex.org/W2126340073","https://openalex.org/W2131776672","https://openalex.org/W2141355868","https://openalex.org/W2151121203","https://openalex.org/W2155177580","https://openalex.org/W2161190897","https://openalex.org/W2174216991","https://openalex.org/W2174245573","https://openalex.org/W2178484001","https://openalex.org/W2292895229","https://openalex.org/W2295747861","https://openalex.org/W2317309498","https://openalex.org/W2602800732","https://openalex.org/W4205585032","https://openalex.org/W4213226240","https://openalex.org/W4233448966"],"related_works":["https://openalex.org/W3125761283","https://openalex.org/W2164081328","https://openalex.org/W1976722080","https://openalex.org/W3152831473","https://openalex.org/W3092556108","https://openalex.org/W1995672666","https://openalex.org/W2154176501","https://openalex.org/W1525389557","https://openalex.org/W2325176099","https://openalex.org/W2583914519"],"abstract_inverted_index":{"Finding":[0],"low-cost":[1],"spanning":[2,27],"subgraphs":[3,28],"with":[4,34,98],"given":[5],"degree":[6,72,77],"and":[7],"connectivity":[8,35,100],"requirements":[9],"is":[10,78,114],"a":[11],"fundamental":[12],"problem":[13,23,97,113],"in":[14],"the":[15,22,38,55,75,96,106,112],"area":[16],"of":[17,24,31,40,57],"network":[18],"design.":[19],"We":[20],"consider":[21],"finding":[25],"d-regular":[26],"(or":[29],"d-factors)":[30],"minimum":[32,76],"weight":[33],"requirements.":[36],"For":[37,54],"case":[39,56],"k-edge-connectedness,":[41],"we":[42,59,93],"present":[43],"approximation":[44,49,62,91],"algorithms":[45,67],"that":[46,95],"achieve":[47,60],"constant":[48,61],"ratios":[50,63],"for":[51,64,70],"all":[52],"d\u22652\u22c5\u2308k/2\u2309.":[53],"k-vertex-connectedness,":[58],"d\u22652k\u22121.":[65],"Our":[66],"also":[68],"work":[69],"arbitrary":[71],"sequences":[73],"if":[74],"at":[79],"least":[80],"2\u22c5\u2308k/2\u2309":[81],"(for":[82,86],"k-edge-connectivity)":[83],"or":[84],"2k\u22121":[85],"k-vertex-connectivity).":[87],"To":[88],"complement":[89],"our":[90],"algorithms,":[92],"prove":[94],"simple":[99],"cannot":[101],"be":[102],"approximated":[103],"better":[104],"than":[105],"traveling":[107],"salesman":[108],"problem.":[109],"In":[110],"particular,":[111],"A":[115],"P":[116],"X-hard.":[117]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}