A study on the minimum subgraph diameter problem
This work addresses the minimum subgraph diameter problem (MSDP), an NP-hard problem. Given a graph with lengths and costs associated with its edges, the MSDP consists in finding a spanning subgraph with total cost limited by a given budget, such that its diameter is minimum. We prove that there is...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
Universidade Estadual de Campinas
2018
|
| Subjects: | |
| Online Access: | https://econtents.sbu.unicamp.br/eventos/index.php/pibic/article/view/174 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864358337042186240 |
|---|---|
| author | Dadalto, Arthur Pratti Usberti, Fabio Luiz Felice, Mário César San |
| author_facet | Dadalto, Arthur Pratti Usberti, Fabio Luiz Felice, Mário César San |
| author_sort | Dadalto, Arthur Pratti |
| collection | Portal de Eventos Científicos da UNICAMP |
| container_reference | Revista dos Trabalhos de Iniciação Científica da UNICAMP; n. 26 (2018): Congresso de Iniciação Científica Unicamp |
| description | This work addresses the minimum subgraph diameter problem (MSDP), an NP-hard problem. Given a graph with lengths and costs associated with its edges, the MSDP consists in finding a spanning subgraph with total cost limited by a given budget, such that its diameter is minimum. We prove that there is no ?-approximation algorithm for the MSDP, for any constant ? unless P = NP. Moreover, we propose a benchmark of instances and present a computational study of mixed integer linear programming formulations and genetic algorithms for the MSDP. |
| first_indexed | 2025-10-08T13:49:53Z |
| format | Online |
| id | ojs-article-174 |
| institution | Universidade Estadual de Campinas |
| issn | 2596-1969 |
| language | eng |
| last_indexed | 2025-10-08T13:49:53Z |
| publishDate | 2018 |
| publisher | Universidade Estadual de Campinas |
| record_format | ojs |
| spelling | ojs-article-1742025-09-26T14:32:30Z A study on the minimum subgraph diameter problem Dadalto, Arthur Pratti Usberti, Fabio Luiz Felice, Mário César San Approximation algorithm Integer linear programming Computational study. This work addresses the minimum subgraph diameter problem (MSDP), an NP-hard problem. Given a graph with lengths and costs associated with its edges, the MSDP consists in finding a spanning subgraph with total cost limited by a given budget, such that its diameter is minimum. We prove that there is no ?-approximation algorithm for the MSDP, for any constant ? unless P = NP. Moreover, we propose a benchmark of instances and present a computational study of mixed integer linear programming formulations and genetic algorithms for the MSDP. Universidade Estadual de Campinas 2018-12-10 info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Artigo de convidado application/pdf https://econtents.sbu.unicamp.br/eventos/index.php/pibic/article/view/174 10.20396/revpibic262018174 Revista dos Trabalhos de Iniciação Científica da UNICAMP; n. 26 (2018): Congresso de Iniciação Científica Unicamp 2596-1969 eng https://econtents.sbu.unicamp.br/eventos/index.php/pibic/article/view/174/146 Copyright (c) 2018 Arthur Pratti Dadalto, Fabio Luiz Usberti http://creativecommons.org/licenses/by/4.0 |
| spellingShingle | Dadalto, Arthur Pratti Usberti, Fabio Luiz Felice, Mário César San Approximation algorithm Integer linear programming Computational study. A study on the minimum subgraph diameter problem |
| title | A study on the minimum subgraph diameter problem |
| title_full | A study on the minimum subgraph diameter problem |
| title_fullStr | A study on the minimum subgraph diameter problem |
| title_full_unstemmed | A study on the minimum subgraph diameter problem |
| title_short | A study on the minimum subgraph diameter problem |
| title_sort | study on the minimum subgraph diameter problem |
| topic | Approximation algorithm Integer linear programming Computational study. |
| url | https://econtents.sbu.unicamp.br/eventos/index.php/pibic/article/view/174 |
| work_keys_str_mv | AT dadaltoarthurpratti astudyontheminimumsubgraphdiameterproblem AT usbertifabioluiz astudyontheminimumsubgraphdiameterproblem AT felicemariocesarsan astudyontheminimumsubgraphdiameterproblem AT dadaltoarthurpratti studyontheminimumsubgraphdiameterproblem AT usbertifabioluiz studyontheminimumsubgraphdiameterproblem AT felicemariocesarsan studyontheminimumsubgraphdiameterproblem |
