{"id":"https://openalex.org/W2016241195","doi":"https://doi.org/10.1137/100801251","title":"A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs","display_name":"A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2016241195","doi":"https://doi.org/10.1137/100801251","mag":"2016241195"},"language":"en","primary_location":{"id":"doi:10.1137/100801251","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100801251","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5079322669","display_name":"Paul Bonsma","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul Bonsma","raw_affiliation_strings":["bonsma@math.tu-berlin.de#TAB#"],"affiliations":[{"raw_affiliation_string":"bonsma@math.tu-berlin.de#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057643324","display_name":"Florian Zickfeld","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florian Zickfeld","raw_affiliation_strings":["zickfeld@math.tu-berlin.de#TAB#"],"affiliations":[{"raw_affiliation_string":"zickfeld@math.tu-berlin.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079322669"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9415,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.74443551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"25","issue":"4","first_page":"1652","last_page":"1666"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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.9817000031471252,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7629460096359253},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.731256902217865},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7201101779937744},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.65699702501297},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6289864182472229},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5853902697563171},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5310248136520386},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4668023884296417},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4563787877559662},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44859209656715393},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4292263388633728},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.25753816962242126},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17738282680511475},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.13277679681777954}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7629460096359253},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.731256902217865},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7201101779937744},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.65699702501297},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6289864182472229},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5853902697563171},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5310248136520386},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4668023884296417},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4563787877559662},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44859209656715393},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4292263388633728},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.25753816962242126},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17738282680511475},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.13277679681777954}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100801251","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100801251","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W782865653","https://openalex.org/W1517042931","https://openalex.org/W1547284637","https://openalex.org/W1581222813","https://openalex.org/W1728611673","https://openalex.org/W1974096415","https://openalex.org/W1987990114","https://openalex.org/W1993219112","https://openalex.org/W1993589418","https://openalex.org/W2011105641","https://openalex.org/W2020354668","https://openalex.org/W2022082910","https://openalex.org/W2040813792","https://openalex.org/W2048653445","https://openalex.org/W2064084823","https://openalex.org/W2083082533","https://openalex.org/W2087477484","https://openalex.org/W2112451853","https://openalex.org/W2134595729","https://openalex.org/W2169848785","https://openalex.org/W2278882866","https://openalex.org/W2706392777","https://openalex.org/W2798588639","https://openalex.org/W3141863997"],"related_works":["https://openalex.org/W1964611452","https://openalex.org/W2090857456","https://openalex.org/W3155900666","https://openalex.org/W4287235520","https://openalex.org/W2373493542","https://openalex.org/W1514905840","https://openalex.org/W1569529368","https://openalex.org/W2058966397","https://openalex.org/W1728611673","https://openalex.org/W1553492721"],"abstract_inverted_index":{"We":[0,16],"consider":[1],"the":[2,11,31,97],"problem":[3,23,102],"of":[4,13,84],"finding":[5],"a":[6,18,43,49,87,94],"spanning":[7],"tree":[8,50,61,88],"that":[9,59],"maximizes":[10],"number":[12],"leaves":[14,66],"(MaxLeaf).":[15],"provide":[17],"3/2-approximation":[19],"algorithm":[20,77,91],"for":[21,34,74,96],"this":[22,35,39],"when":[24],"restricted":[25],"to":[26,70],"cubic":[27,104],"graphs,":[28],"improving":[29],"on":[30],"previous":[32,71],"5/3-approximation":[33],"class.":[36],"To":[37],"obtain":[38],"approximation":[40,72],"we":[41,57],"define":[42],"graph":[44],"parameter":[45],"$x(G)$":[46],"and":[47,56],"construct":[48],"with":[51,62,79],"at":[52],"least":[53],"$(n-x(G)+4)/3$":[54],"leaves,":[55],"prove":[58],"no":[60],"more":[63],"than":[64],"$(n-x(G)+2)/2$":[65],"exists.":[67],"In":[68],"contrast":[69],"algorithms":[73],"MaxLeaf,":[75],"our":[76],"works":[78],"connected":[80,99],"dominating":[81,100],"sets":[82],"instead":[83],"by":[85],"constructing":[86],"directly.":[89],"The":[90],"also":[92],"yields":[93],"4/3-approximation":[95],"minimum":[98],"set":[101],"in":[103],"graphs.":[105]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}