Login / Signup
A Localized Algorithm Based on Minimum Cost Arborescences for the MECBS Problem with Asymmetric Edge Costs.
Frederico J. R. Barboza
Flávio Assis
Published in:
ADHOCNETS (2011)
Keyphrases
</>
minimum cost
np hard
objective function
network flow
similarity measure
matching algorithm
computational complexity
worst case
undirected graph
search space
special case
linear programming
distance function
ant colony optimization
convergence rate
weighted graph