Approximation algorithms for decomposing octilinear polygons.
Serafino CiceroneGabriele Di StefanoPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- facility location problem
- worst case
- constant factor
- set cover
- network design problem
- np hardness
- primal dual
- combinatorial auctions
- randomized algorithms
- approximation ratio
- approximation schemes
- open shop
- exact algorithms
- convex hull
- mathematical model
- linear programming
- feasible solution
- minimum length
- polynomial time approximation
- dynamic programming
- lower bound
- search algorithm