{"id":"https://openalex.org/W4410702682","doi":"https://doi.org/10.1007/s10107-025-02233-0","title":"A $$\\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs","display_name":"A $$\\nicefrac {4}{3}$$-approximation for the maximum leaf spanning arborescence problem in DAGs","publication_year":2025,"publication_date":"2025-05-24","ids":{"openalex":"https://openalex.org/W4410702682","doi":"https://doi.org/10.1007/s10107-025-02233-0","pmid":"https://pubmed.ncbi.nlm.nih.gov/42064623"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-025-02233-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02233-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02233-0.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","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02233-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060646500","display_name":"Meike Neuwohner","orcid":"https://orcid.org/0000-0002-3664-3687"},"institutions":[{"id":"https://openalex.org/I909854389","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I909854389"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Meike Neuwohner","raw_affiliation_strings":["Department of Mathematics, London School of Economics and Political Science, London, UK"],"raw_orcid":"https://orcid.org/0000-0002-3664-3687","affiliations":[{"raw_affiliation_string":"Department of Mathematics, London School of Economics and Political Science, London, UK","institution_ids":["https://openalex.org/I909854389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060646500"],"corresponding_institution_ids":["https://openalex.org/I909854389"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11813313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"216","issue":"1-2","first_page":"111","last_page":"133"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962000250816345,"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/T11106","display_name":"Data Management and Algorithms","score":0.9957000017166138,"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/mathematics","display_name":"Mathematics","score":0.7445206642150879},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47057148814201355},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.44190514087677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4284176528453827},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41397473216056824}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7445206642150879},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47057148814201355},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.44190514087677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4284176528453827},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41397473216056824}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-025-02233-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02233-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02233-0.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":"pmid:42064623","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/42064623","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical programming","raw_type":null},{"id":"pmh:oai:researchonline.lse.ac.uk:128103","is_oa":true,"landing_page_url":"https://orcid.org/0000-0002-3664-3687>","pdf_url":"https://researchonline.lse.ac.uk/id/eprint/128103/1/s10107-025-02233-0.pdf","source":{"id":"https://openalex.org/S7407055460","display_name":"LSE Research Online","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:pubmedcentral.nih.gov:13124901","is_oa":true,"landing_page_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC13124901/","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"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":"Math Program","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s10107-025-02233-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02233-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02233-0.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/G8695986878","display_name":"New perspectives towards Woodall's Conjecture and the Generalised Berge-Fulkerson Conjecture","funder_award_id":"EP/X030989/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410702682.pdf","grobid_xml":"https://content.openalex.org/works/W4410702682.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W221072716","https://openalex.org/W1615046544","https://openalex.org/W1676390513","https://openalex.org/W1974096415","https://openalex.org/W1987990114","https://openalex.org/W1999681430","https://openalex.org/W2001663593","https://openalex.org/W2030562672","https://openalex.org/W2035040468","https://openalex.org/W2083082533","https://openalex.org/W2159579504","https://openalex.org/W2274535290","https://openalex.org/W2327315803","https://openalex.org/W2401610261","https://openalex.org/W2964217904","https://openalex.org/W3141863997","https://openalex.org/W3180187830","https://openalex.org/W3216012570","https://openalex.org/W4316652443","https://openalex.org/W4316652470","https://openalex.org/W4388178321","https://openalex.org/W4398172563"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W4296605418","https://openalex.org/W4385493656","https://openalex.org/W1553492721"],"abstract_inverted_index":{"Abstract":[0],"The":[1,62,215],"Maximum":[2],"Leaf":[3],"Spanning":[4],"Arborescence":[5],"problem":[6,131,271,304],"(MLSA)":[7],"in":[8,64,163,213,255,264],"directed":[9,19],"acyclic":[10,20],"graphs":[11],"(dags)":[12],"is":[13,44,66,102,220,356],"defined":[14],"as":[15,71,266],"follows:":[16],"Given":[17],"a":[18,24,47,133,141,167,193,221,238,245,267,274,306],"graph":[21],"G":[22],"and":[23,77,80,87,106,165,233,257,284,286],"vertex":[25,43],"$$r\\in":[26],"V(G)$$":[27],"<mml:math":[28,95,120,145,169,195,292,310,349],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[29,96,121,146,170,196,293,311,350],"<mml:mrow>":[30,147,312,316],"<mml:mi>r</mml:mi>":[31],"<mml:mo>\u2208</mml:mo>":[32],"<mml:mi>V</mml:mi>":[33],"<mml:mo>(</mml:mo>":[34],"<mml:mi>G</mml:mi>":[35],"<mml:mo>)</mml:mo>":[36],"</mml:mrow>":[37,157,320,326],"</mml:math>":[38,101,123,158,175,201,295,327,355],"from":[39],"which":[40],"every":[41],"other":[42,335],"reachable,":[45],"find":[46],"spanning":[48],"arborescence":[49],"rooted":[50],"at":[51],"r":[52],"maximizing":[53],"the":[54,88,126,161,178,204,211,249,253,262,280,298,330,334],"number":[55],"of":[56,93,136,228,248,347],"leaves":[57],"(vertices":[58],"with":[59,363],"out-degree":[60],"zero).":[61],"MLSA":[63,162,212,254,263,331],"dags":[65,256,265],"known":[67,90],"to":[68,104,231],"be":[69,235],"APX-hard":[70],"reported":[72],"by":[73,191,260,282],"Nadine":[74],"Schwartges,":[75],"Spoerhase,":[76],"Wolff":[78],"(Approximation":[79],"Online":[81],"Algorithms,":[82],"Springer,":[83],"Berlin":[84],"Heidelberg,":[85],"2012)":[86],"best":[89,357],"approximation":[91,345],"guarantee":[92,346],"$$\\frac{7}{5}$$":[94,168],"<mml:mfrac>":[97,150,171,197,315,351],"<mml:mn>7</mml:mn>":[98,172],"<mml:mn>5</mml:mn>":[99,173],"</mml:mfrac>":[100,153,174,200,322,354],"due":[103],"Fernandes":[105,283],"Lintzmayer":[107,285],"(J.":[108],"Comput.":[109],"Syst.":[110],"Sci.":[111],"135:":[112],"158\u2013174,2023):":[113],"They":[114],"prove":[115],"that":[116,217,288,343],"any":[117],"$$\\alpha":[118,290],"$$":[119,291],"<mml:mi>\u03b1</mml:mi>":[122,155,294,324],"-approximation":[124,159,176,202,296,328],"for":[125,160,177,203,297,329,359],"hereditary":[127,179,205,268,299],"3-":[128],"set":[129,258,269,302],"packing":[130,181,207,259,270,303],",":[132],"special":[134],"case":[135],"weighted":[137],"3-set":[138,180,206],"packing,":[139],"yields":[140],"$$\\max":[142,307],"\\{\\frac{4}{3},\\alpha":[143],"\\}$$":[144,309],"<mml:mo>max</mml:mo>":[148,313],"<mml:mo>{</mml:mo>":[149,314],"<mml:mn>4</mml:mn>":[151,198,352],"<mml:mn>3</mml:mn>":[152,199,353],"<mml:mo>,</mml:mo>":[154,323],"<mml:mo>}</mml:mo>":[156,325],"dags,":[164],"provide":[166,244,338],"problem.":[182],"In":[183],"this":[184,189],"paper,":[185],"we":[186,218,278,337],"improve":[187],"upon":[188],"result":[190],"providing":[192],"$$\\frac{4}{3}$$":[194,348],"problem,":[208],"and,":[209],"thus,":[210],"dags.":[214,332],"algorithm":[216],"study":[219],"simple":[222],"local":[223,360],"search":[224,361],"procedure":[225],"considering":[226],"swaps":[227],"size":[229],"up":[230],"10":[232],"can":[234],"analyzed":[236],"via":[237],"two-stage":[239],"charging":[240],"argument.":[241],"We":[242],"further":[243],"clear":[246],"picture":[247],"general":[250],"connection":[251],"between":[252],"rephrasing":[261],".":[272],"With":[273],"much":[275],"simpler":[276],"proof,":[277],"extend":[279],"reduction":[281],"show":[287],"an":[289],"k":[300],"-":[301],"implies":[305],"\\{\\frac{k+1}{k},\\alpha":[308],"<mml:mi>k</mml:mi>":[317,321],"<mml:mo>+</mml:mo>":[318],"<mml:mn>1</mml:mn>":[319],"On":[333],"hand,":[336],"lower":[339],"bound":[340],"examples":[341],"proving":[342],"our":[344],"possible":[358],"algorithms":[362],"constant":[364],"improvement":[365],"size.":[366]},"counts_by_year":[],"updated_date":"2026-05-17T08:19:37.847499","created_date":"2025-10-10T00:00:00"}