{"id":"https://openalex.org/W2469064012","doi":"https://doi.org/10.1007/s11590-016-1057-x","title":"The recoverable robust spanning tree problem with interval costs is polynomially solvable","display_name":"The recoverable robust spanning tree problem with interval costs is polynomially solvable","publication_year":2016,"publication_date":"2016-07-04","ids":{"openalex":"https://openalex.org/W2469064012","doi":"https://doi.org/10.1007/s11590-016-1057-x","mag":"2469064012"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-016-1057-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-016-1057-x","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs11590-016-1057-x.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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%2Fs11590-016-1057-x.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005536070","display_name":"Mikita Hradovich","orcid":null},"institutions":[{"id":"https://openalex.org/I11923345","display_name":"Wroc\u0142aw University of Science and Technology","ror":"https://ror.org/008fyn775","country_code":"PL","type":"education","lineage":["https://openalex.org/I11923345"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Mikita Hradovich","raw_affiliation_strings":["Faculty of Fundamental Problems of Technology, Wroc\u0142aw University of Technology, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Fundamental Problems of Technology, Wroc\u0142aw University of Technology, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I11923345"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082213199","display_name":"Adam Kasperski","orcid":"https://orcid.org/0000-0003-1956-1812"},"institutions":[{"id":"https://openalex.org/I11923345","display_name":"Wroc\u0142aw University of Science and Technology","ror":"https://ror.org/008fyn775","country_code":"PL","type":"education","lineage":["https://openalex.org/I11923345"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Adam Kasperski","raw_affiliation_strings":["Faculty of Computer Science and Management, Wroc\u0142aw University of Technology, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science and Management, Wroc\u0142aw University of Technology, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I11923345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035521253","display_name":"Pawe\u0142 Zieli\u0144ski","orcid":"https://orcid.org/0000-0002-1466-2887"},"institutions":[{"id":"https://openalex.org/I11923345","display_name":"Wroc\u0142aw University of Science and Technology","ror":"https://ror.org/008fyn775","country_code":"PL","type":"education","lineage":["https://openalex.org/I11923345"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Zieli\u0144ski","raw_affiliation_strings":["Faculty of Fundamental Problems of Technology, Wroc\u0142aw University of Technology, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Fundamental Problems of Technology, Wroc\u0142aw University of Technology, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I11923345"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082213199"],"corresponding_institution_ids":["https://openalex.org/I11923345"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":2.2365,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89074285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"11","issue":"1","first_page":"17","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9750999808311462,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7317596673965454},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.676138699054718},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6351196765899658},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.5983614921569824},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5760119557380676},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5275161862373352},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5121588706970215},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.51161128282547},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4705161154270172},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4679478704929352},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43130603432655334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39938172698020935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31559261679649353},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1128033995628357}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7317596673965454},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.676138699054718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6351196765899658},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.5983614921569824},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5760119557380676},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5275161862373352},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5121588706970215},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.51161128282547},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4705161154270172},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4679478704929352},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43130603432655334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39938172698020935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31559261679649353},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1128033995628357},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-016-1057-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-016-1057-x","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs11590-016-1057-x.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s11590-016-1057-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-016-1057-x","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs11590-016-1057-x.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G836749445","display_name":null,"funder_award_id":"2013/09/B/ST6/01525","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2469064012.pdf","grobid_xml":"https://content.openalex.org/works/W2469064012.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W64710111","https://openalex.org/W1523324024","https://openalex.org/W1636491287","https://openalex.org/W1727529013","https://openalex.org/W1963888335","https://openalex.org/W1977545325","https://openalex.org/W1977847591","https://openalex.org/W1980035156","https://openalex.org/W1991528957","https://openalex.org/W2034844194","https://openalex.org/W2080656989","https://openalex.org/W2165775468","https://openalex.org/W2268180454","https://openalex.org/W2552451242","https://openalex.org/W4253347690"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W2390742649","https://openalex.org/W3101281637","https://openalex.org/W1561849181"],"abstract_inverted_index":{"In":[0],"this":[1,18,43],"paper":[2],"the":[3,35,46],"recoverable":[4,47,59],"robust":[5,48,60],"spanning":[6],"tree":[7],"problem":[8,19,36,51],"with":[9],"interval":[10],"edge":[11],"costs":[12],"is":[13,32,37,52],"considered.":[14],"The":[15],"complexity":[16],"of":[17,42],"has":[20],"remained":[21],"open":[22],"to":[23,45],"date.":[24],"By":[25],"using":[26],"an":[27],"iterative":[28],"relaxation":[29],"method,":[30],"it":[31],"shown":[33],"that":[34],"polynomially":[38],"solvable.":[39],"A":[40],"generalization":[41],"idea":[44],"matroid":[49],"basis":[50],"also":[53],"presented.":[54],"Polynomial":[55],"algorithms":[56],"for":[57],"both":[58],"problems":[61],"are":[62],"proposed.":[63]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}