{"id":"https://openalex.org/W2022130029","doi":"https://doi.org/10.1007/s10589-013-9556-5","title":"Lower and upper bounds for the spanning tree with minimum branch vertices","display_name":"Lower and upper bounds for the spanning tree with minimum branch vertices","publication_year":2013,"publication_date":"2013-04-02","ids":{"openalex":"https://openalex.org/W2022130029","doi":"https://doi.org/10.1007/s10589-013-9556-5","mag":"2022130029"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-013-9556-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-013-9556-5","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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 Optimization and Applications","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/A5032185912","display_name":"Francesco Carrabs","orcid":"https://orcid.org/0000-0003-2187-8624"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Carrabs","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e1 di Salerno, 84084, Fisciano, Italy","Dipartimento di Matematica, Universit\u00e1 di Salerno, Fisciano, Italy 84084#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e1 di Salerno, 84084, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e1 di Salerno, Fisciano, Italy 84084#TAB#","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034899414","display_name":"Raffaele Cerulli","orcid":"https://orcid.org/0000-0002-3277-6802"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Raffaele Cerulli","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e1 di Salerno, 84084, Fisciano, Italy","Dipartimento di Matematica, Universit\u00e1 di Salerno, Fisciano, Italy 84084#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e1 di Salerno, 84084, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e1 di Salerno, Fisciano, Italy 84084#TAB#","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087376257","display_name":"Manlio Gaudioso","orcid":"https://orcid.org/0000-0002-3022-7041"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Manlio Gaudioso","raw_affiliation_strings":["Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, Universit\u00e1 della Calabria, 87036, Rende, Italy","Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, Universit\u00e1 della Calabria, Rende, Italy 87036#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, Universit\u00e1 della Calabria, 87036, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, Universit\u00e1 della Calabria, Rende, Italy 87036#TAB#","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055370413","display_name":"Monica Gentili","orcid":"https://orcid.org/0000-0003-3895-0629"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Monica Gentili","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e1 di Salerno, 84084, Fisciano, Italy","Dipartimento di Matematica, Universit\u00e1 di Salerno, Fisciano, Italy 84084#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e1 di Salerno, 84084, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e1 di Salerno, Fisciano, Italy 84084#TAB#","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055370413"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":2.2599,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.88482377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"56","issue":"2","first_page":"405","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9995999932289124,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9995999932289124,"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.9940000176429749,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8113488554954529},{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.7593665719032288},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.7537370920181274},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.589259147644043},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.5732774138450623},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5566132664680481},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5549677610397339},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5540032386779785},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5280776023864746},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5270460247993469},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.48115861415863037},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4780602753162384},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4747893214225769},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4413872957229614},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4350399374961853},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.4259815812110901},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4194568395614624},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17086246609687805},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.0877760648727417},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07596972584724426}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8113488554954529},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.7593665719032288},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.7537370920181274},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.589259147644043},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.5732774138450623},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5566132664680481},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5549677610397339},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5540032386779785},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5280776023864746},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5270460247993469},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.48115861415863037},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4780602753162384},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4747893214225769},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4413872957229614},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4350399374961853},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.4259815812110901},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4194568395614624},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17086246609687805},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.0877760648727417},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07596972584724426},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10589-013-9556-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-013-9556-5","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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 Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.388.2502","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.388.2502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dipmat.unisa.it/people/carrabs/www/pdf/2013_SPT_MinimumBranchVertices.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:coopap:v:56:y:2013:i:2:p:405-438","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10589-013-9556-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":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W27073611","https://openalex.org/W31709568","https://openalex.org/W212203016","https://openalex.org/W1486993561","https://openalex.org/W1553702074","https://openalex.org/W1558071713","https://openalex.org/W1588423454","https://openalex.org/W1963899113","https://openalex.org/W1968143987","https://openalex.org/W1970025200","https://openalex.org/W1977545325","https://openalex.org/W1984620595","https://openalex.org/W1985752510","https://openalex.org/W1989369524","https://openalex.org/W2005022214","https://openalex.org/W2021438403","https://openalex.org/W2044793578","https://openalex.org/W2057725412","https://openalex.org/W2096938240","https://openalex.org/W2139317321","https://openalex.org/W2798566347"],"related_works":["https://openalex.org/W2527517796","https://openalex.org/W1561849181","https://openalex.org/W2090857456","https://openalex.org/W88291963","https://openalex.org/W1569529368","https://openalex.org/W2010585027","https://openalex.org/W79941410","https://openalex.org/W1879012921","https://openalex.org/W4210544217","https://openalex.org/W2022130029"],"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":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}