241 search results - page 2 / 49 » Degree Bounded Spanning Trees |
IPCO
1996
13 years 8 months ago
1996
SAC
2000
ACM
13 years 11 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
ESA
1994
Springer
13 years 11 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...