230 search results - page 10 / 46 » Minimum Spanning Tree Problem with Label Selection |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
NETWORKS
2008
13 years 7 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...