Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.

Dae-Young Seo D. T. Lee Tien-Ching Lin

Published in: ISAAC (2009)

Keyphrases

minimum cost
spanning tree
np hard
approximation algorithms
network flow
capacity constraints
undirected graph
network flow problem
network simplex algorithm
worst case
special case
lower bound
optimal solution
minimal surface
edit operations
ant colony optimization
lagrangian relaxation
objective function