{"id":"https://openalex.org/W2035040468","doi":"https://doi.org/10.1016/0020-0190(94)90139-2","title":"A short note on the approximability of the maximum leaves spanning tree problem","display_name":"A short note on the approximability of the maximum leaves spanning tree problem","publication_year":1994,"publication_date":"1994-10-01","ids":{"openalex":"https://openalex.org/W2035040468","doi":"https://doi.org/10.1016/0020-0190(94)90139-2","mag":"2035040468"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(94)90139-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90139-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5012585989","display_name":"Giulia Galbiati","orcid":null},"institutions":[{"id":"https://openalex.org/I25217355","display_name":"University of Pavia","ror":"https://ror.org/00s6t1f81","country_code":"IT","type":"education","lineage":["https://openalex.org/I25217355"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"G. Galbiati","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Pavia, Italy","Dipartimento di Informatica e Sistemistica, Universita' degli Studi di Pavia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universita' degli Studi di Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053677027","display_name":"Francesco Maffioli","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Maffioli","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Italy","Dipartimento di Elettronica, Politecnico di Milano, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Italy","institution_ids":["https://openalex.org/I93860229"]},{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Italy#TAB#","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054994026","display_name":"Angelo Morzenti","orcid":"https://orcid.org/0000-0002-6469-2929"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Morzenti","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Italy","Dipartimento di Elettronica, Politecnico di Milano, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Italy","institution_ids":["https://openalex.org/I93860229"]},{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Italy#TAB#","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012585989"],"corresponding_institution_ids":["https://openalex.org/I25217355"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":1.2996,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.80372309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"52","issue":"1","first_page":"45","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9984999895095825,"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.9983000159263611,"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/spanning-tree","display_name":"Spanning tree","score":0.7738171815872192},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7484038472175598},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7445547580718994},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.7292503714561462},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.637354850769043},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.563237190246582},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4824657738208771},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4664102792739868},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46614590287208557},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4643426835536957},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4637734293937683},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.42798078060150146},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.20615920424461365},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.15027037262916565},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14354479312896729}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7738171815872192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7484038472175598},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7445547580718994},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.7292503714561462},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.637354850769043},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.563237190246582},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4824657738208771},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4664102792739868},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46614590287208557},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4643426835536957},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4637734293937683},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.42798078060150146},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.20615920424461365},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.15027037262916565},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14354479312896729}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0020-0190(94)90139-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(94)90139-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:re.public.polimi.it:11311/666228","is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/666228","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W28005281","https://openalex.org/W266979934","https://openalex.org/W1972345639","https://openalex.org/W2011039300","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2111132249","https://openalex.org/W2132605415","https://openalex.org/W2143391442","https://openalex.org/W6609907991"],"related_works":["https://openalex.org/W2081066931","https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W1964611452","https://openalex.org/W4380840098","https://openalex.org/W1985149601","https://openalex.org/W2390742649","https://openalex.org/W620960161","https://openalex.org/W2162201886","https://openalex.org/W1998126097"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}