{"id":"https://openalex.org/W221072716","doi":"https://doi.org/10.1007/978-3-642-29116-6_7","title":"Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs","display_name":"Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W221072716","doi":"https://doi.org/10.1007/978-3-642-29116-6_7","mag":"221072716"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-29116-6_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-29116-6_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/A5036894065","display_name":"Nadine Schwartges","orcid":null},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Nadine Schwartges","raw_affiliation_strings":["Computer Science I, University of W\u00fcrzburg, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science I, University of W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052812610","display_name":"Joachim Spoerhase","orcid":"https://orcid.org/0000-0002-2601-6452"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joachim Spoerhase","raw_affiliation_strings":["Computer Science I, University of W\u00fcrzburg, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science I, University of W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014138072","display_name":"Alexander Wolff","orcid":"https://orcid.org/0000-0001-5872-718X"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Wolff","raw_affiliation_strings":["Computer Science I, University of W\u00fcrzburg, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science I, University of W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036894065"],"corresponding_institution_ids":["https://openalex.org/I25974101"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1589,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.7539499,"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":"77","last_page":"88"},"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.9998000264167786,"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.9998000264167786,"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/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/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"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/digraph","display_name":"Digraph","score":0.8776450157165527},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7439078092575073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.710883378982544},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5508235096931458},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5263475179672241},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4705154001712799},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44459208846092224},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4366236925125122},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4336945414543152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.378088116645813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36930376291275024},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3405631482601166}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8776450157165527},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7439078092575073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.710883378982544},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5508235096931458},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5263475179672241},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4705154001712799},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44459208846092224},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4366236925125122},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4336945414543152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.378088116645813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36930376291275024},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3405631482601166}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-29116-6_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-29116-6_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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1543611576","https://openalex.org/W1589421353","https://openalex.org/W1615046544","https://openalex.org/W1673084046","https://openalex.org/W1728611673","https://openalex.org/W1968497507","https://openalex.org/W1974096415","https://openalex.org/W1991055327","https://openalex.org/W1993589418","https://openalex.org/W2005771129","https://openalex.org/W2011039300","https://openalex.org/W2011105641","https://openalex.org/W2016241195","https://openalex.org/W2035040468","https://openalex.org/W2083082533","https://openalex.org/W2112451853","https://openalex.org/W2138156539","https://openalex.org/W2295958421","https://openalex.org/W2495008722","https://openalex.org/W2505201213","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2376814941","https://openalex.org/W2562218965","https://openalex.org/W2138987445","https://openalex.org/W3081212354","https://openalex.org/W2943635264","https://openalex.org/W3116169590","https://openalex.org/W2055747731","https://openalex.org/W2099915933","https://openalex.org/W2390742649"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"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"}