An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://repositorio.inesctec.pt/handle/123456789/5403 http://dx.doi.org/10.1007/s11590-013-0665-y |
Resumo: | This paper presents a newedge-swap heuristic for generating spanning trees with a minimum number of branch vertices, i.e. vertices of degree greater than two. This problem was introduced in Gargano et al. (Lect Notes Comput Sci 2380:355-365, 2002) and has been called the minimum branch vertices problem by Cerulli et al. (Comput Optim Appl 42:353-370, 2009). The heuristic starts with a random spanning tree and iteratively reduces the number of branch vertices by swapping tree edges with edges not currently in the tree. It can be easily implemented as a multi-start heuristic. We report on extensive computational experiments comparing single-start and multi-start variants on our heuristic with other heuristics previously proposed in the literature. |
id |
RCAP_950471fd4c7b8883b566a92abb8b9b50 |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/5403 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
An edge-swap heuristic for generating spanning trees with minimum number of branch verticesThis paper presents a newedge-swap heuristic for generating spanning trees with a minimum number of branch vertices, i.e. vertices of degree greater than two. This problem was introduced in Gargano et al. (Lect Notes Comput Sci 2380:355-365, 2002) and has been called the minimum branch vertices problem by Cerulli et al. (Comput Optim Appl 42:353-370, 2009). The heuristic starts with a random spanning tree and iteratively reduces the number of branch vertices by swapping tree edges with edges not currently in the tree. It can be easily implemented as a multi-start heuristic. We report on extensive computational experiments comparing single-start and multi-start variants on our heuristic with other heuristics previously proposed in the literature.2018-01-03T13:11:21Z2014-01-01T00:00:00Z2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/5403http://dx.doi.org/10.1007/s11590-013-0665-yengSilva,RMASilva,DMResende,MGCMateus,GRJosé Fernando GonçalvesFesta,Pinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:18Zoai:repositorio.inesctec.pt:123456789/5403Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:52:56.569144Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
title |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
spellingShingle |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices Silva,RMA |
title_short |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
title_full |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
title_fullStr |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
title_full_unstemmed |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
title_sort |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
author |
Silva,RMA |
author_facet |
Silva,RMA Silva,DM Resende,MGC Mateus,GR José Fernando Gonçalves Festa,P |
author_role |
author |
author2 |
Silva,DM Resende,MGC Mateus,GR José Fernando Gonçalves Festa,P |
author2_role |
author author author author author |
dc.contributor.author.fl_str_mv |
Silva,RMA Silva,DM Resende,MGC Mateus,GR José Fernando Gonçalves Festa,P |
description |
This paper presents a newedge-swap heuristic for generating spanning trees with a minimum number of branch vertices, i.e. vertices of degree greater than two. This problem was introduced in Gargano et al. (Lect Notes Comput Sci 2380:355-365, 2002) and has been called the minimum branch vertices problem by Cerulli et al. (Comput Optim Appl 42:353-370, 2009). The heuristic starts with a random spanning tree and iteratively reduces the number of branch vertices by swapping tree edges with edges not currently in the tree. It can be easily implemented as a multi-start heuristic. We report on extensive computational experiments comparing single-start and multi-start variants on our heuristic with other heuristics previously proposed in the literature. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-01-01T00:00:00Z 2014 2018-01-03T13:11:21Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://repositorio.inesctec.pt/handle/123456789/5403 http://dx.doi.org/10.1007/s11590-013-0665-y |
url |
http://repositorio.inesctec.pt/handle/123456789/5403 http://dx.doi.org/10.1007/s11590-013-0665-y |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131604780580864 |