Improved approximations for weighted and unweighted graph problems

Theory of Computing Systems

Volumn 38, Issue 6, 2005, Pages 763-787

  Demange, Marc ^a   Paschos, Vangelis ^b  

^a ESSEC BUSINESS SCHOOL   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; COLORING PROBLEMS; INDUCED SUBGRAPHS; MAXIMIZATION PROBLEM; MAXIMUM INDEPENDENT SETS; MULTIPLICATIVE CONSTANTS; UNWEIGHTED GRAPHS; WEIGHTED INDEPENDENT SET PROBLEM;

MATHEMATICAL TECHNIQUES;

COMPUTER SCIENCE;

EID: 29844439144     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1162-6     Document Type: Article

References (31)

1. N. Alon and N. Kahale. Approximating the independence number via the θ-function. Math. Programming, 80:253-264, 1998.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Berlin, 1999.
3. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir. On chromatic sums and distributed resource allocation. Inform. and Comput., 140:183-202, 1988.
4. B. B. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32(2): 180-196, New York, 1992.
5. P. Crescenzi, V. Kann, R. Silvestri, and L. Trevisan. Structure in approximation classes. SIAM J. Comput., 28(5):1759-1782, 1999.
6. P. Crescenzi and A. Panconesi. Completeness in approximation classes. Inform. and Comput., 93(2):241-262, 1991.
7. P. Crescenzi, R. Silvestri, and L. Trevisan. To weight or not to weight: where is the question? In Proc. Israeli Symposium on Theory of Computing and Systems, pages 68-77. IEEE, New York, 1996.
8. M. Demange, J. Monnot, and V. T. Paschos. Bridging gap between standard and differential polynomial approximation: the case of bin-packing. Appl. Math. Lett., 12:127-133, 1999.
9. M. Demange and V. T. Paschos. Improved approximations for maximum independent set via approximation chains. Appl. Math. Lett., 10(3): 105-110, 1997.
10. M. Demange and V. T. Paschos. Maximum-weight independent set is as "well-approximated" as the unweighted one. Technical Report 163, LAMSADE, Université Paris-Dauphine, June 1999.
11. G. H. Golub and C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, 1983.
12. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-197, 1981.
13. M. M. Halldórsson. A still better performance guarantee for approximate graph coloring. Inform. Process. Lett., 45(1):19-23, 1993.
14. M. M. Halldórsson. Approximations of weighted independent set and hereditary subset problems. In Proc. 5th Ann. Int. Conf. on Computing and Combinatorics, pages 261-270. Lecture Notes in Computer Science 1627. Springer-Verlag, Berlin, 1999.
15. M. M. Halldórsson. Approximations of weighted independent set and hereditary subset problems. J. Graph Algorithms Appl., 4(1): 1-16, 2000.
16. M. M. Halldórsson and J. Radhakrishnan. Greed is good: approximating independent sets in sparse and bounded-degree graphs. In Proc. STOC '94, pages 439-448, 1994.
17. 1-ε. Acta Math., 182:105-142, 1999.
18. D. S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS, Boston, MA, 1997.
19. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. System Sci., 9:256-278, 1974.
20. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. J. Assoc. Comput. Mach., 45(2):246-265, 1998.
21. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. J. Assoc. Comput. Mach., 45(2):246-265, 1998.
22. L. Lovász. Three short proofs in graph theory. J. Combin. Theory Ser. B, 19:269-271, 1975.
23. L. Lovász. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory, 25(1): 1-7, 1979.
24. S. Mahajan and H. Ramesh. Derandomizmg semidefinite programming based approximation algorithms. In Proc. FOCS '95, pages 162-169, 1995.
25. J. Monnot, V. T. Paschos, and S. Toulouse. Differential approximation results for the traveling salesman problem with distances 1 and 2. European J. Oper. Res., 145(3):557-568, 2002.
26. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. J. Comput. System Sci., 43:425-440, 1991.
27. V. T. Paschos. Approximation of weighted hereditary induced-subgraph maximization problems. Technical Report 160, LAMSADE, Université Paris-Dauphine, January 1999.
28. V. T. Paschos and L. Renotte. Approximability preserving reductions for NP-complete problems. Found. Comput. Decision Sci., 20(1):49-71, 1995.
29. H. U. Simon. On approximate solutions for combinatorial optimization problems. SIAM J. Discrete Math., 3(2):294-310, 1990.
30. P. Turán. On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok, 48:436-452, 1941.
31. V. Vazirani. Approximation Algorithms. Springer-Verlag, Berlin, 2001.