Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs.
David S. JohnsonLee BreslauIlias DiakonikolasNick G. DuffieldYu GuMohammadTaghi HajiaghayiHoward J. KarloffMauricio G. C. ResendeSubhabrata SenPublished in: CoRR (2016)
Keyphrases
- facility location
- set cover
- integer programming
- np hard
- greedy algorithm
- network flow
- approximation algorithms
- greedy heuristics
- lagrangian relaxation
- minimum cost
- network design
- mixed integer
- convex hull
- solution space
- greedy heuristic
- shortest path
- multi criteria
- optimal solution
- primal dual
- multistage
- worst case
- communication networks
- special case
- heuristic search
- computational complexity
- linear program