|
7
|
Computing A Diameter-Constrained Minimum Spanning Tree
– Ayman Mahmoud Abdalla
- 2001
|
|
|
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
– Omer ANgel, et al.
- 2008
|
|
3
|
Neighbourhood Searches for the Bounded Diameter . . .
– Martin Gruber, Jano van Hemert, Günther R. Raidl
- 2006
|
|
|
Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances
– Martin Gruber, Günther R. Raidl
|
|
31
|
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
– Günther R. Raidl, B. Julstrom
- 2003
|
|
|
(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem
– Martin Gruber, Günther R. Raidl
|
|
|
www.cg.tuwien.ac.at (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem
– Martin Gruber, Günther R. Raidl, Martin Gruber, Günther R. Raidl
- 2008
|
|
13
|
Variable neighborhood search for the bounded diameter minimum spanning tree problem
– Martin Gruber, Günther R. Raidl
- 2005
|
|
|
On the Expected Number of Level-I Nodes in a
– Random Labeled Tree
- 2004
|
|
1
|
THE DISTRIBUTION OF HEIGHT AND DIAMETER IN RANDOM NON-PLANE BINARY TREES
– Nicolas Broutin, Philippe Flajolet
|
|
20
|
Approximating the Weight of Shallow Steiner Trees
– Guy Kortsarz, David Peleg
- 1998
|
|
|
A New Hybrid Genetic Algorithm for Solving the Bounded Diameter Minimum Spanning Tree Problem
– Huynh Thi, Thanh Binh, Nguyen Xuan Hoai, R. I (bob Mckay
|
|
|
Graph theory in the information age ∗
– Fan Chung
|
|
403
|
How bad is selfish routing?
– Tim Roughgarden, Éva Tardos
- 2002
|
|
|
Bounded-Diameter MST Instances with Hybridization of Multi-Objective EA
– Soma Saha, Rajeev Kumar
|
|
1
|
Some new methods and results in tree enumeration
– A. M. Odlyzko
- 1984
|
|
2
|
Biased mutation operators for subgraph-selection problems
– Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom
- 2004
|
|
4
|
Branched Polymers
– Richard Kenyon, Peter Winkler
|
|
98
|
Asymptotic enumeration methods
– A. M. Odlyzko
- 1995
|
