{"id":"https://openalex.org/W1576394469","doi":"https://doi.org/10.1007/978-3-540-92248-3_7","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":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1576394469","doi":"https://doi.org/10.1007/978-3-540-92248-3_7","mag":"1576394469"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-92248-3_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-92248-3_7","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/A5079322669","display_name":"Paul Bonsma","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Paul Bonsma","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057643324","display_name":"Florian Zickfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian Zickfeld","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079322669"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9307,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83806879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"66","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9962000250816345,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9850999712944031,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7050164937973022},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6846732497215271},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6718937158584595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6045252084732056},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5749609470367432},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5603931546211243},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5189635157585144},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48338595032691956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44721320271492004},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44453346729278564},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38777977228164673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3560446798801422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3536895513534546},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.24159350991249084},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20433306694030762},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10442492365837097}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7050164937973022},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6846732497215271},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6718937158584595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6045252084732056},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5749609470367432},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5603931546211243},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5189635157585144},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48338595032691956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44721320271492004},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44453346729278564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38777977228164673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3560446798801422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3536895513534546},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.24159350991249084},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20433306694030762},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10442492365837097}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-92248-3_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-92248-3_7","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"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/W1987990114","https://openalex.org/W1993589418","https://openalex.org/W2011105641","https://openalex.org/W2020354668","https://openalex.org/W2022082910","https://openalex.org/W2048653445","https://openalex.org/W2064084823","https://openalex.org/W2083082533","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/W2518240130","https://openalex.org/W2943635264","https://openalex.org/W4380840098","https://openalex.org/W1985149601","https://openalex.org/W1964611452","https://openalex.org/W620960161","https://openalex.org/W3016811403","https://openalex.org/W2390742649","https://openalex.org/W3081212354","https://openalex.org/W2138987445"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}