{"id":"https://openalex.org/W2607867111","doi":"https://doi.org/10.1007/s10107-017-1150-7","title":"Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems","display_name":"Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems","publication_year":2017,"publication_date":"2017-04-25","ids":{"openalex":"https://openalex.org/W2607867111","doi":"https://doi.org/10.1007/s10107-017-1150-7","mag":"2607867111"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-017-1150-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-017-1150-7","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5007379194","display_name":"Andr\u00e9 Linhares","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Andr\u00e9 Linhares","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031968426","display_name":"Chaitanya Swamy","orcid":"https://orcid.org/0000-0003-1108-7941"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Chaitanya Swamy","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007379194"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.2357,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.54236552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"172","issue":"1-2","first_page":"17","last_page":"34"},"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.9983000159263611,"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.9983000159263611,"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.9965000152587891,"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.9617999792098999,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.7937110662460327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7241772413253784},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6117229461669922},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6018819808959961},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5753545761108398},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4944789409637451},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48587435483932495},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4723854064941406},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.46686339378356934},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4662095010280609},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4661492109298706},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.4343017339706421},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4227454960346222},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3249935507774353},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.23959407210350037},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17821374535560608}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7937110662460327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7241772413253784},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6117229461669922},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6018819808959961},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5753545761108398},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4944789409637451},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48587435483932495},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4723854064941406},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.46686339378356934},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4662095010280609},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4661492109298706},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.4343017339706421},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4227454960346222},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3249935507774353},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.23959407210350037},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17821374535560608},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-017-1150-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-017-1150-7","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/17"}],"awards":[{"id":"https://openalex.org/G1328002221","display_name":null,"funder_award_id":"Early Researcher Award","funder_id":"https://openalex.org/F4320321886","funder_display_name":"Ontario Ministry of Research, Innovation and Science"},{"id":"https://openalex.org/G3547378653","display_name":null,"funder_award_id":"327620-09","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G7788291121","display_name":null,"funder_award_id":"Discovery Accelerator Supplement","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320321886","display_name":"Ontario Ministry of Research, Innovation and Science","ror":"https://ror.org/03zr1tg88"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W90301214","https://openalex.org/W1480355964","https://openalex.org/W1526762477","https://openalex.org/W1575402053","https://openalex.org/W1998141189","https://openalex.org/W2055505431","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2081444009","https://openalex.org/W2083246371","https://openalex.org/W2157421865","https://openalex.org/W2159115597","https://openalex.org/W2172955861","https://openalex.org/W2174409790","https://openalex.org/W2176322034","https://openalex.org/W2369536682","https://openalex.org/W2808077833","https://openalex.org/W2891873695","https://openalex.org/W2952752670","https://openalex.org/W2952824168"],"related_works":["https://openalex.org/W4320232260","https://openalex.org/W4252399622","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2142695913","https://openalex.org/W2039006033","https://openalex.org/W4236384091","https://openalex.org/W4382892785","https://openalex.org/W2406038525","https://openalex.org/W2413161265"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}