A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Euclidean bounded-degree spanning tree ratios
Proceedings of the nineteenth annual symposium on Computational geometry
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Degree-bounded minimum spanning trees
Discrete Applied Mathematics
The Euclidean degree-4 minimum spanning tree problem is NP-hard
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the bias and performance of the edge-set encoding
IEEE Transactions on Evolutionary Computation
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Theoretical Computer Science
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
On degree constrained shortest paths
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Degree-bounded minimum spanning tree for unit disk graph
Theoretical Computer Science
| Hi-index | 0.00 |