Login / Signup
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.
Luis Eduardo Neves Gouveia
Thomas L. Magnanti
Cristina Requejo
Published in:
Networks (2004)
Keyphrases
</>
steiner tree
shortest path
minimum spanning tree
maximum distance
minimum cost
facility location
spanning tree
linear programming relaxation
neural network
search algorithm
graphical models
linear program
graph theory