Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay.
Noam TouitouPublished in: ISAAC (2021)
Keyphrases
- lower bound
- network design
- set cover
- np hard
- upper bound
- approximation algorithms
- greedy heuristic
- greedy algorithm
- greedy heuristics
- worst case
- network design problem
- network flow
- branch and bound
- branch and bound algorithm
- scheduling problem
- optimal solution
- communication networks
- objective function
- network architecture
- integer programming
- convex hull
- solution space
- linear program
- lagrangian relaxation
- knapsack problem
- primal dual
- linear programming
- quality of service
- ip networks
- constraint satisfaction problems
- intrusion detection
- switched networks