Algorithm for Raising OXC Port Count to Meet Traffic Growth at Minimum Cost.

Kosuke Sato Yojiro Mori Hiroshi Hasegawa Ken-ichi Sato

Published in: JOCN (2017)

Keyphrases

np hard
computational complexity
minimum cost
worst case
objective function
matching algorithm
optimal solution
dynamic programming
spanning tree
network flow problem
linear programming
distance function
ant colony optimization
approximation algorithms
undirected graph