Differential approximation algorithms for some combinatorial optimization problems

Theoretical Computer Science

Volumn 209, Issue 1-2, 1998, Pages 107-122

  Demange, Marc ^a,b   Grisoni, Pascal ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

Bin packing; coloring; NP complete problem; Polynomial time approximation algorithm; Set covering

Indexed keywords

EID: 0001226932     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00099-6     Document Type: Article

References (20)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, in: Proc. FOCS'92, 1992, pp. 14-23.
2. G. Ausiello, A. D'Atri, M. Protasi, Structure preserving reductions among convex optimization problems, J. Comput. System Sci. 21 (1980) 136-153.
3. A. Blum, New approximation algorithms for graph coloring, J. ACM 41 (3) (1994) 470-516.
4. R.L. Brooks, On coloring the nodes of a network, Proc. Cambridge Philos. Soc. 37 (1941) 194-197.
5. V. Chvátal, A greedy - heuristic for the set covering problem, Math. Oper. Res. 4 (1979) 233-235.
6. M. Demange, P. Grisoni, V.Th. Paschos, Approximation results for the minimum graph coloring problem, Inform. Process. Lett. 50 (1994) 19-23.
7. M. Demange, V.Th. Paschos, On an approximation measure founded on the links between optimization and polynomial approximation theory, Theoret. Comput. Sci. 158 (1996) 117-141.
8. W. Fernandez de la Vega, G.S. Lueker, Bin packing can be solved within 1 + ε in linear time, Combinatorica 1 (4) (1981) 349-355.
9. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979.
10. M.M. Halldórsson, A still better performance guarantee for approximate graph coloring, Inform. Process. Lett. 45 (1993) 19-23.
11. M.M. Halldórsson, Approximating discrete collections via local improvements, in: Proc. Symp. on Disc. Maths, 1995, pp. 160-169.
12. M.M. Halldórsson, Approximating set cover via local improvements, JAIST Resarch Report IS-RR-95-0002F, JAIST, Tatsunokuchi, Japan, 1995.
13. R. Hassin, S. Lahav, Maximizing the number of unused colors in the vertex coloring problem, Inform. Process. Lett. 52 (1994) 87-90.
14. D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256-278.
15. L.T. Kou, L.J. Stockmeyer, C.K. Wong, Covering edges by cliques with regard to keyword conflicts and intersection graphs, Comm. ACM 21 (1978) 135-139.
16. L. Lovász, Three short proofs in graph theory, J. Comb. Theory B 19 (1975) 269-271.
17. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975) 383-390.
18. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, in: Proc. STOC'93 1993, 286-293.
19. H.U. Simon, On approximate solutions for combinatorial optimization problems, SIAM J. Discrete Math. 3 (2) (1990) 294-310.
20. S.A. Vavasis, Approximation algorithms for indefinite quadratic programming, Math. Programming 57 (1992) 279-311.