We consider a class of network-design problems with minimum sum of modification and network costs for minimum spanning trees under Hamming distance. By constructing three auxiliary networks, we present a strongly polynomial-time algorithm for this problem. The method can be applied to solve many network-design problems. And, we show that a variation model of this problem is NP-hard, even when the underlying network is a tree, by transforming the 0–1 knapsack problem to this model. doi:10.1017/S144618111700011
The module introduces students to a version of the Network Design problem (NDP) that arises in the p...
Abstract. We study the problem of finding small trees. Classical network design problems are conside...
An important class of problems that occur in different fields of research as biology, linguistics or...
The problem of designing a communication network for a given set of requirements has been studied ex...
We consider the problem of reducing the edge lengths of a given network so that the modified network...
Given an undirected and connected graph G, with a non-negative weight on each edge, the Minimum Aver...
International audienceGiven an undirected and connected graph G, with a non-negative weight on each ...
In a typical instance of a network design problem, we are given a directed or undirected graph G = (...
We propose and study a new model for the spanning tree problem with interval data, the Minimum Risk ...
Given a network G(V,A,c) and a collection of origin-destination pairs with prescribed values, the...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
AbstractThe minimum spanning tree problem is a classical and well-known combinatorial optimization p...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Given an undirected graph with costs associated to its edges and pairs of edges, the \emph{Quadratic...
In the network design problem we are given a weighted undirected graph. We wish to find a subgraph w...
The module introduces students to a version of the Network Design problem (NDP) that arises in the p...
Abstract. We study the problem of finding small trees. Classical network design problems are conside...
An important class of problems that occur in different fields of research as biology, linguistics or...
The problem of designing a communication network for a given set of requirements has been studied ex...
We consider the problem of reducing the edge lengths of a given network so that the modified network...
Given an undirected and connected graph G, with a non-negative weight on each edge, the Minimum Aver...
International audienceGiven an undirected and connected graph G, with a non-negative weight on each ...
In a typical instance of a network design problem, we are given a directed or undirected graph G = (...
We propose and study a new model for the spanning tree problem with interval data, the Minimum Risk ...
Given a network G(V,A,c) and a collection of origin-destination pairs with prescribed values, the...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
AbstractThe minimum spanning tree problem is a classical and well-known combinatorial optimization p...
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanni...
Given an undirected graph with costs associated to its edges and pairs of edges, the \emph{Quadratic...
In the network design problem we are given a weighted undirected graph. We wish to find a subgraph w...
The module introduces students to a version of the Network Design problem (NDP) that arises in the p...
Abstract. We study the problem of finding small trees. Classical network design problems are conside...
An important class of problems that occur in different fields of research as biology, linguistics or...
Add to ORKG