209 search results - page 6 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
166
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
131
Voted
CCCG
2007
15 years 5 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
135
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
141
Voted
SAC
2000
ACM
15 years 8 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...
139
Voted
AINA
2009
IEEE
15 years 10 months ago
2009
IEEE
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...