Differential approximation algorithms for some combinatorial optimization problems
- 6 December 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 209 (1-2) , 107-122
- https://doi.org/10.1016/s0304-3975(97)00099-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- On an approximation measure founded on the links between optimization and polynomial approximation theoryTheoretical Computer Science, 1996
- Maximizing the number of unused colors in the vertex coloring problemInformation Processing Letters, 1994
- New approximation algorithms for graph coloringJournal of the ACM, 1994
- Approximation results for the minimum graph coloring problemInformation Processing Letters, 1994
- A still better performance guarantee for approximate graph coloringInformation Processing Letters, 1993
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 1980
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Covering edges by cliques with regard to keyword conflicts and intersection graphsCommunications of the ACM, 1978