{"id":"https://openalex.org/W2174799808","doi":"https://doi.org/10.1007/3-540-59175-3_97","title":"On the approximability of some maximum spanning tree problems","display_name":"On the approximability of some maximum spanning tree problems","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2174799808","doi":"https://doi.org/10.1007/3-540-59175-3_97","mag":"2174799808"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-59175-3_97","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-59175-3_97","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":"conference-paper","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":false,"raw_author_name":"Giulia Galbiati","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Pavia, Via Abbiategrasso 209, 27100, Pavia, Italia","Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Pavia, Pavia, Italia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Pavia, Via Abbiategrasso 209, 27100, Pavia, Italia","institution_ids":["https://openalex.org/I25217355"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Pavia, Pavia, Italia","institution_ids":["https://openalex.org/I25217355"]}]},{"author_position":"middle","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":"Angelo Morzenti","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milano, Italia","Dipartimento di Elettronica, Politecnico di Milano, Milano, Italia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milano, Italia","institution_ids":["https://openalex.org/I93860229"]},{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Milano, Italia","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","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":"Francesco Maffioli","raw_affiliation_strings":["Dipartimento di Elettronica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milano, Italia","Dipartimento di Elettronica, Politecnico di Milano, Milano, Italia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milano, Italia","institution_ids":["https://openalex.org/I93860229"]},{"raw_affiliation_string":"Dipartimento di Elettronica, Politecnico di Milano, Milano, Italia","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3477,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.52574526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"300","last_page":"310"},"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.9998999834060669,"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.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8055646419525146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7701268196105957},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7437542080879211},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5744360089302063},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.48921704292297363},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47054773569107056},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46892932057380676},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4558507204055786},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4521803855895996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42925506830215454},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4133962094783783},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.3533700406551361},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.1450328230857849},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14053875207901},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11156439781188965}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8055646419525146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7701268196105957},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7437542080879211},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5744360089302063},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.48921704292297363},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47054773569107056},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46892932057380676},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4558507204055786},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4521803855895996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42925506830215454},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4133962094783783},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.3533700406551361},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.1450328230857849},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14053875207901},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11156439781188965},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-59175-3_97","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-59175-3_97","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":[{"display_name":"Climate action","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1499479569","https://openalex.org/W1569752386","https://openalex.org/W1608772366","https://openalex.org/W1779055272","https://openalex.org/W1967957610","https://openalex.org/W1972345639","https://openalex.org/W1973264741","https://openalex.org/W1976157781","https://openalex.org/W1989224473","https://openalex.org/W2002764437","https://openalex.org/W2031153755","https://openalex.org/W2035040468","https://openalex.org/W2038225707","https://openalex.org/W2072970829","https://openalex.org/W2074417667","https://openalex.org/W2143391442","https://openalex.org/W2949867427","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W1985149601","https://openalex.org/W1965702747","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W1576317141","https://openalex.org/W2911818503","https://openalex.org/W2582147058","https://openalex.org/W2071845176","https://openalex.org/W2039611868"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}