Approximation Algorithms for Directed Weighted Spanners.
Elena GrigorescuNithish KumarYoung-San LinPublished in: APPROX/RANDOM (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- network design problem
- facility location problem
- set cover
- primal dual
- randomized algorithms
- constant factor
- open shop
- minimum cost
- approximation ratio
- disjoint paths
- np hardness
- precedence constraints
- exact algorithms
- combinatorial auctions
- undirected graph
- weighted sum
- approximation schemes
- theoretical analysis
- linear programming
- lower bound