44 search results - page 2 / 9 » An ant-based algorithm for finding degree-constrained minimu... |
150
click to vote
CATS
1998
15 years 4 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
165
click to vote
GECCO
2009
Springer
15 years 10 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. ...
127
Voted
ICCNMC
2005
Springer
15 years 9 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
126
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
127
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...