Approximation Algorithms and an Integer Program for Multi-level Graph Spanners.
Abu Reyan AhmedKeaton HammMohammad Javad Latifi JebelliStephen G. KobourovFaryad Darabi SahnehRichard SpencePublished in: SEA² (2019)
Keyphrases
- approximation algorithms
- integer program
- undirected graph
- np hard
- constant factor
- integer programming
- linear program
- minimum cost
- disjoint paths
- special case
- worst case
- column generation
- vertex cover
- spanning tree
- network flow
- facility location problem
- approximation ratio
- approximation schemes
- primal dual
- cutting plane
- set cover
- graph structure
- planar graphs
- open shop
- valid inequalities
- linear programming relaxation
- directed acyclic graph
- linear programming
- precedence constraints
- computational complexity
- constant factor approximation
- weighted graph
- bipartite graph
- convex optimization
- connected components
- social network analysis
- random walk
- state space
- dynamic programming
- evolutionary algorithm