Approximation Algorithms for Bounded Color Matchings via Convex Decompositions.
Georgios StamoulisPublished in: MFCS (2) (2014)
Keyphrases
- approximation algorithms
- np hard
- vertex cover
- special case
- strictly convex
- color images
- worst case
- quadratic program
- horizontal and vertical projections
- network design problem
- approximation schemes
- approximation ratio
- exact algorithms
- np hardness
- primal dual
- minimum cost
- set cover
- facility location problem
- randomized algorithms
- undirected graph
- convex sets
- constant factor
- open shop
- precedence constraints
- convex optimization
- disjoint paths
- search algorithm
- constant factor approximation
- dynamic programming
- convex hull
- error bounds
- optimal solution
- convex functions