Approximation Algorithms for Facial Cycles in Planar Embeddings.
Giordano Da LozzoIgnaz RutterPublished in: ISAAC (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- facial expressions
- facial images
- face recognition
- vertex cover
- minimum cost
- primal dual
- facial features
- approximation ratio
- facility location problem
- low dimensional
- exact algorithms
- precedence constraints
- open shop
- set cover
- network design problem
- np hardness
- constant factor
- randomized algorithms
- approximation schemes
- face images
- undirected graph
- linear program
- planar graphs
- combinatorial auctions
- distance measure
- polynomial time approximation
- scheduling problem