{"id":"https://openalex.org/W4414774250","doi":"https://doi.org/10.1007/978-3-032-06706-7_10","title":"Low Recourse Arborescence Forests Under Uniformly Random Arcs","display_name":"Low Recourse Arborescence Forests Under Uniformly Random Arcs","publication_year":2025,"publication_date":"2025-09-30","ids":{"openalex":"https://openalex.org/W4414774250","doi":"https://doi.org/10.1007/978-3-032-06706-7_10"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-06706-7_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-06706-7_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5119826657","display_name":"J. Niklas Dahlmeier","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J. Niklas Dahlmeier","raw_affiliation_strings":["RWTH Aachen, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021573603","display_name":"D Ellis Hershkowitz","orcid":"https://orcid.org/0000-0003-0862-3715"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Ellis Hershkowitz","raw_affiliation_strings":["Brown University, Providence, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Providence, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5119826657"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60804549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"142","last_page":"156"},"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.9994999766349792,"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/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/cardinality","display_name":"Cardinality (data modeling)","score":0.8302000164985657},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.7847999930381775},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.7190999984741211},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6281999945640564},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5310999751091003},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.32330000400543213}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8302000164985657},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.7847999930381775},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.7190999984741211},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6281999945640564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5548999905586243},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5310999751091003},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5121999979019165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40220001339912415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.367000013589859},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2987000048160553},{"id":"https://openalex.org/C2778408900","wikidata":"https://www.wikidata.org/wiki/Q1329258","display_name":"Cardinal number (linguistics)","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.273499995470047},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.2590999901294708}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-032-06706-7_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-06706-7_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:publications.rwth-aachen.de:1029888","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/1029888","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Approximation and Online Algorithms : 23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18\u201319, 2025, Proceedings / edited by Jannik Matuschke, Jos\u00e9 Verschae<br/>23. International Workshop on Approximation and Online Algorithms, WAOA 2025, Warsaw, Poland, 2025-09-18 - 2025-09-19","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1501694180","https://openalex.org/W1982512167","https://openalex.org/W2012287357","https://openalex.org/W2020927880","https://openalex.org/W2029437526","https://openalex.org/W2051294918","https://openalex.org/W2071608792","https://openalex.org/W2083082533","https://openalex.org/W2109767783","https://openalex.org/W2122886291","https://openalex.org/W2129322254","https://openalex.org/W2155096670","https://openalex.org/W2259724869","https://openalex.org/W2336317531","https://openalex.org/W2469267808","https://openalex.org/W2550458906","https://openalex.org/W2738074097","https://openalex.org/W2783336934","https://openalex.org/W2974337481","https://openalex.org/W3001440696","https://openalex.org/W3101025384","https://openalex.org/W3128100256","https://openalex.org/W3195680291","https://openalex.org/W4206150395","https://openalex.org/W4206501214","https://openalex.org/W4235109644","https://openalex.org/W4243588724","https://openalex.org/W4246185962","https://openalex.org/W4247656554","https://openalex.org/W4376639541","https://openalex.org/W4390098092","https://openalex.org/W4390575693","https://openalex.org/W4390575861"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}