A Tight Lower Bound for Relaxed Loop-Free Updates in SDNs.
Hao ZhouXiaofeng GaoJiaqi ZhengGuihai ChenPublished in: ICDCS (2019)
Keyphrases
- lower bound
- upper bound
- optimal solution
- branch and bound algorithm
- branch and bound
- np hard
- lower and upper bounds
- worst case
- upper and lower bounds
- objective function
- lower bounding
- linear programming relaxation
- vc dimension
- neural network
- linear programming
- data structure
- website
- information systems
- real time
- branch and bound method