Sciweavers

3875 search results - page 21 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
COCO
1997
Springer
77views Algorithms» more  COCO 1997»
15 years 6 months ago
Constraint Satisfaction: The Approximability of Minimization Problems
Sanjeev Khanna, Madhu Sudan, Luca Trevisan
102
Voted
SODA
2000
ACM
137views Algorithms» more  SODA 2000»
15 years 3 months ago
Approximating the maximum quadratic assignment problem
Esther M. Arkin, Refael Hassin
CCCG
2006
15 years 3 months ago
An Improved Approximation Factor For The Unit Disk Covering Problem
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
Sada Narayanappa, Petr Vojtechovský
ISAAC
2010
Springer
265views Algorithms» more  ISAAC 2010»
15 years 12 days ago
On the Approximability of the Maximum Interval Constrained Coloring Problem
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...