{"id":"https://openalex.org/W2083790738","doi":"https://doi.org/10.1007/s10287-009-0116-5","title":"Reformulations and solution algorithms for the maximum leaf spanning tree problem","display_name":"Reformulations and solution algorithms for the maximum leaf spanning tree problem","publication_year":2010,"publication_date":"2010-01-06","ids":{"openalex":"https://openalex.org/W2083790738","doi":"https://doi.org/10.1007/s10287-009-0116-5","mag":"2083790738"},"language":"en","primary_location":{"id":"doi:10.1007/s10287-009-0116-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10287-009-0116-5","pdf_url":null,"source":{"id":"https://openalex.org/S28822639","display_name":"Computational Management Science","issn_l":"1619-697X","issn":["1619-697X","1619-6988"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Management Science","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/A5013552701","display_name":"Ab\u00edlio Lucena","orcid":"https://orcid.org/0000-0001-6627-7692"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Abilio Lucena","raw_affiliation_strings":["Departamento de Administra\u00e7\u00e3o and Programa de Sistemas e Computa\u00e7\u00e3o-COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil","Universidade Federal do Rio de Janeiro"],"affiliations":[{"raw_affiliation_string":"Departamento de Administra\u00e7\u00e3o and Programa de Sistemas e Computa\u00e7\u00e3o-COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]},{"raw_affiliation_string":"Universidade Federal do Rio de Janeiro","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091887230","display_name":"Nelson Maculan","orcid":"https://orcid.org/0000-0002-3897-3356"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Nelson Maculan","raw_affiliation_strings":["Programa de Sistemas e Computa\u00e7\u00e3o-COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil","Universidade Federal do Rio de Janeiro"],"affiliations":[{"raw_affiliation_string":"Programa de Sistemas e Computa\u00e7\u00e3o-COPPE, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]},{"raw_affiliation_string":"Universidade Federal do Rio de Janeiro","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091887801","display_name":"Luidi Simonetti","orcid":"https://orcid.org/0000-0001-8273-9439"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luidi Simonetti","raw_affiliation_strings":["Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas, Campinas, Brazil","Universidade Estadual de Campinas"],"affiliations":[{"raw_affiliation_string":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas, Campinas, Brazil","institution_ids":["https://openalex.org/I181391015"]},{"raw_affiliation_string":"Universidade Estadual de Campinas","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013552701"],"corresponding_institution_ids":["https://openalex.org/I122140584"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8808,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.77880676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"289","last_page":"311"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8224948048591614},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6044716238975525},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5991342663764954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5336905717849731},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.499997615814209},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4952663481235504},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4889358580112457},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.47928184270858765},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.47469085454940796},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.46945804357528687},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46440649032592773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45262596011161804},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.42643147706985474},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42507097125053406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3857603371143341},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3581206798553467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3177921175956726},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2436327338218689}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8224948048591614},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6044716238975525},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5991342663764954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5336905717849731},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.499997615814209},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4952663481235504},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4889358580112457},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.47928184270858765},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.47469085454940796},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.46945804357528687},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46440649032592773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45262596011161804},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.42643147706985474},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42507097125053406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3857603371143341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3581206798553467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3177921175956726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2436327338218689}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10287-009-0116-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10287-009-0116-5","pdf_url":null,"source":{"id":"https://openalex.org/S28822639","display_name":"Computational Management Science","issn_l":"1619-697X","issn":["1619-697X","1619-6988"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Management Science","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:comgts:v:7:y:2010:i:3:p:289-311","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10287-009-0116-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W92251871","https://openalex.org/W266979934","https://openalex.org/W625072069","https://openalex.org/W1486993561","https://openalex.org/W1550030180","https://openalex.org/W1592704656","https://openalex.org/W1728611673","https://openalex.org/W1991528957","https://openalex.org/W1993589418","https://openalex.org/W2002872142","https://openalex.org/W2007503572","https://openalex.org/W2007917614","https://openalex.org/W2008534472","https://openalex.org/W2011039300","https://openalex.org/W2020586530","https://openalex.org/W2035040468","https://openalex.org/W2069643240","https://openalex.org/W2093399914","https://openalex.org/W2100344930","https://openalex.org/W2139349113","https://openalex.org/W2148636444","https://openalex.org/W2155239253","https://openalex.org/W2155526624","https://openalex.org/W2164245156","https://openalex.org/W2169848785","https://openalex.org/W2476096155","https://openalex.org/W3123635721","https://openalex.org/W3141863997"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2943635264","https://openalex.org/W3211968237","https://openalex.org/W88291963","https://openalex.org/W2014991506","https://openalex.org/W1842018596","https://openalex.org/W1997715470","https://openalex.org/W2069643240","https://openalex.org/W1569529368","https://openalex.org/W2083790738"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}