Login / Signup
Minimum Cost SDN Routing With Reconfiguration Frequency Constraints.
Apostolos Destounis
Stefano Paris
Lorenzo Maggi
Georgios S. Paschos
Jeremie Leguay
Published in:
IEEE/ACM Trans. Netw. (2018)
Keyphrases
</>
minimum cost
capacity constraints
np hard
network flow
linear relaxation
spanning tree
approximation algorithms
network flow problem
network simplex algorithm
minimum cost flow
routing problem
edit operations
undirected graph
routing algorithm
constraint programming
shortest path
linear programming