Abstract: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 genet… Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.