{"id":"https://openalex.org/W2592046007","doi":"https://doi.org/10.1007/s10107-017-1126-7","title":"Chain-constrained spanning trees","display_name":"Chain-constrained spanning trees","publication_year":2017,"publication_date":"2017-02-27","ids":{"openalex":"https://openalex.org/W2592046007","doi":"https://doi.org/10.1007/s10107-017-1126-7","mag":"2592046007"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-017-1126-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-017-1126-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-017-1126-7.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-017-1126-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071590414","display_name":"Neil Olver","orcid":"https://orcid.org/0000-0001-8897-5459"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Neil Olver","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands","Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071590414"],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I865915315"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.7126,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73901393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"167","issue":"2","first_page":"293","last_page":"314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9891999959945679,"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/spanning-tree","display_name":"Spanning tree","score":0.7969323396682739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7505414485931396},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6488814353942871},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5527464747428894},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.4983386993408203},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4904319941997528},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.48914507031440735},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.45469728112220764},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4430922865867615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4242451786994934},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.41254982352256775},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3233972191810608},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.28913232684135437},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2189631462097168},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15819811820983887}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7969323396682739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7505414485931396},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6488814353942871},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5527464747428894},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.4983386993408203},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4904319941997528},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.48914507031440735},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.45469728112220764},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4430922865867615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4242451786994934},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.41254982352256775},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3233972191810608},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.28913232684135437},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2189631462097168},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15819811820983887},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s10107-017-1126-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-017-1126-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-017-1126-7.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:cwi.nl:26960","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/26960","pdf_url":"https://ir.cwi.nl/pub/26960/26960.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming vol. 167, pp. 293-314","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:eprints.lse.ac.uk:103085","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-8897-5459>","pdf_url":"http://eprints.lse.ac.uk/103085/1/Chain_constrained_spanning_trees.pdf","source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:eprints.lse.ac.uk:103175","is_oa":false,"landing_page_url":"http://eprints.lse.ac.uk/103175/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/017e1869-5519-4969-a3eb-5ae7f72dfed5","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/017e1869-5519-4969-a3eb-5ae7f72dfed5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Olver , N K & Zenklusen , R 2018 , ' Chain-constrained spanning trees ' , Mathematical Programming , vol. 167 , no. 2 , pp. 293\u2013314 . https://doi.org/10.1007/s10107-017-1126-7","raw_type":"article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/5e7626b8-b865-411f-922b-de6620b8b6b0","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/5e7626b8-b865-411f-922b-de6620b8b6b0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Olver , N K & Zenklusen , R 2013 , ' Chain-Constrained Spanning Trees ' , Lecture Notes in Computer Science , vol. 7801 , pp. 324-335 . https://doi.org/10.1007/978-3-642-36694-9_28","raw_type":"article"},{"id":"pmh:oai:research.vu.nl:publications/017e1869-5519-4969-a3eb-5ae7f72dfed5","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/017e1869-5519-4969-a3eb-5ae7f72dfed5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Olver , N K & Zenklusen , R 2018 , ' Chain-constrained spanning trees ' , Mathematical Programming , vol. 167 , no. 2 , pp. 293\u2013314 . https://doi.org/10.1007/s10107-017-1126-7","raw_type":"article"},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/129103","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/129103","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 167 (2)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.3929/ethz-b-000129103","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000129103","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s10107-017-1126-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-017-1126-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-017-1126-7.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1378150017","display_name":null,"funder_award_id":"CCF-1115849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3055568360","display_name":"New Approaches to Constrained Submodular Maximization","funder_award_id":"165866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4480591096","display_name":"MHV-2001: Roman Wine amphorae during the Republican Period: Production and Diffusion of Dressel 1 amphorae. The ArchaeometricContribution to the History of Ancient Commerce and Economy","funder_award_id":"65866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4836148144","display_name":"Immunologie des Typ-1 Diabetes.","funder_award_id":"20002","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4923525702","display_name":"3D-Supermicado: a holistic 3D super resolution light and electron microscopy workflow to advance cellular delivery of therapeutic oligonucleotides","funder_award_id":"20002","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5926618553","display_name":null,"funder_award_id":"200021_165866","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G7507259859","display_name":"Shock Proteins and Retinal Ganglion Cells in Different Models of Experimental Optic Neuropathies","funder_award_id":"115849","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G8281068745","display_name":null,"funder_award_id":"1115849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G993971353","display_name":null,"funder_award_id":"200021","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2592046007.pdf","grobid_xml":"https://content.openalex.org/works/W2592046007.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W126431888","https://openalex.org/W1480355964","https://openalex.org/W1526762477","https://openalex.org/W1575402053","https://openalex.org/W1976151323","https://openalex.org/W1998141189","https://openalex.org/W2055505431","https://openalex.org/W2063807274","https://openalex.org/W2066700938","https://openalex.org/W2081444009","https://openalex.org/W2083383617","https://openalex.org/W2103992755","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/W2891873695","https://openalex.org/W2951794910","https://openalex.org/W2952752670","https://openalex.org/W2952824168","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2390742649","https://openalex.org/W1978034843","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W2582147058","https://openalex.org/W1576317141","https://openalex.org/W1958279402","https://openalex.org/W2350349857","https://openalex.org/W193918669"],"abstract_inverted_index":{"We":[0,95,149],"consider":[1,96],"the":[2,21,25,36,40,51,61,123,160,165],"problem":[3,26,37,102,124],"of":[4,12,27,63,87,93,103,115,128,145,167],"finding":[5,28],"a":[6,10,29,46,90,97,113,118,126,135,143,168,174],"spanning":[7,30,47,67,100,136,171],"tree":[8,31,48,68,101,137,172],"satisfying":[9],"family":[11,114,127],"additional":[13],"constraints.":[14,34,94],"Several":[15],"settings":[16,80],"have":[17],"been":[18],"considered":[19],"previously,":[20],"most":[22,147],"famous":[23],"being":[24],"with":[32],"degree":[33],"Since":[35],"is":[38,42],"hard,":[39],"goal":[41],"typically":[43],"to":[44,77,79,125,134,162,187],"find":[45],"that":[49,138],"violates":[50,139],"constraints":[52],"as":[53,55,185],"little":[54],"possible.":[56],"Iterative":[57],"rounding":[58,72],"has":[59],"become":[60],"tool":[62],"choice":[64],"for":[65],"constrained":[66,99,170],"problems.":[69],"However,":[70],"iterative":[71],"approaches":[73],"are":[74,110,159],"very":[75],"hard":[76],"adapt":[78],"where":[81,107],"an":[82],"edge":[83],"can":[84,179],"be":[85,180],"part":[86],"more":[88],"than":[89],"constant":[91],"number":[92],"natural":[98],"this":[104],"type,":[105],"namely":[106],"upper":[108],"bounds":[109],"imposed":[111],"on":[112],"cuts":[116],"forming":[117],"chain.":[119],"Our":[120],"approach":[121],"reduces":[122],"independent":[129],"matroid":[130],"intersection":[131],"problems,":[132],"leading":[133],"each":[140],"constraint":[141,189],"by":[142],"factor":[144],"at":[146],"9.":[148],"also":[150],"present":[151],"strong":[152],"hardness":[153],"results:":[154],"among":[155],"other":[156],"implications,":[157],"these":[158],"first":[161],"show,":[163],"in":[164],"setting":[166],"basic":[169],"problem,":[173],"qualitative":[175],"difference":[176],"between":[177],"what":[178],"achieved":[181],"when":[182],"allowing":[183],"multiplicative":[184],"opposed":[186],"additive":[188],"violations.":[190]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}