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!
|
