Approximation and hardness results for the maximum edge q-coloring problem.
Anna AdamaszekAlexandru PopaPublished in: J. Discrete Algorithms (2016)
Keyphrases
- approximation error
- undirected graph
- edge information
- approximation algorithms
- maximum error
- worst case
- edge detection
- computational complexity
- np hard
- weighted graph
- closed form
- edge detector
- maximum number
- learning algorithm
- np complete
- edge direction
- relative error
- approximation ratio
- learning theory
- integrality gap
- queueing networks
- efficient computation
- error bounds
- special case
- color images
- image processing