Approximation Algorithms for Partitioning a Rectangle with Interior Points.
Teofilo F. GonzalezSi-Qing ZhengPublished in: Algorithmica (1990)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- minimum bounding
- exact algorithms
- randomized algorithms
- primal dual
- approximation ratio
- precedence constraints
- network design problem
- point sets
- constant factor
- data points
- undirected graph
- disjoint paths
- approximation schemes
- open shop
- line segments
- lower bound
- polynomial time approximation
- convex hull