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