Approximation Algorithms for Orthogonal Line Centers.
Arun Kumar DasSandip DasJoydeep MukherjeePublished in: CALDAM (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- facility location problem
- set cover
- exact algorithms
- np hardness
- approximation ratio
- network design problem
- approximation schemes
- disjoint paths
- randomized algorithms
- lower bound
- optimal solution
- constant factor
- primal dual
- combinatorial auctions
- knapsack problem
- theoretical analysis
- scheduling problem
- search algorithm