On the complexity of approximating colored-graph problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 281-290

  Clementi, Andrea E F ^a   Crescenzi, Pierluigi ^b   Rossi, Gianluca ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; OPTIMIZATION;

BOUNDED DEGREE GRAPHS; BOUNDED DIAMETER; GRAPH PROBLEMS; INAPPROXIMABILITY; MINIMUM DELAY; OPTIMIZATION PROBLEMS; SCHEDULE PROBLEMS; STORE AND FORWARD NETWORKS;

COMPLEX NETWORKS;

EID: 84886757950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_28     Document Type: Conference Paper

References (22)

1. Alon, N., Feige, U., Wigderson, A., and Zuckerman, D. Derandomized graph products. Computational Complexity 5 (1995), 60-75
2. Appel, K., and Haken, W. Every planar map is four colorable. part I: discharging. Illinois J. Math. 21 (1977), 429-490
3. Appel, K., and Haken, W. Every planar map is four colorable. part II: reducibility. Illinois J. Math. 21 (1977), 491-567
4. Berman, P., and Karpinski, M. On some tighter inapproximability results. Further improvements. Tech. Rep. TR98-065, ECCC, 1998
5. Boppana, R., and Halldórsson, M. M. Approximating maximum independent sets by excluding subgraphs. Bit 32 (1992), 180-196
6. Clementi, A., and Di Ianni, M. On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Transaction on Networking 4 (1996), 272-280
7. Feige, U., and Kilian, J. Zero knowledge and the chromatic number. In Proc. Eleventh Ann. IEEE Conf. on Comp. Complexity (1996), IEEE Computer Society, pp. 278-287
8. Garey, M., Johnson, D., and Stockmeyer, L. Some simplified NP-complete graph problems. Theoretical Comput. Sci. 1 (1976), 237-267
9. Garey, M. R., and Johnson, D. S. Computers and Intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco, 1979
10. Goemans, M. X., and Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42 (1995b), 1115-1145
11. Halldórsson, M. M. A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45 (1993a), 19-23
12. 1−∈. In Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci. (1996), IEEE Computer Society, pp. 627- 636
13. Håstad, J. Some optimal inapproximability results. In Proc. 29th Ann. ACM Symp. on Theory of Comp. (1997), ACM, pp. 1-10
14. Hochbaum, D. S. Efficient bounds for the stable set, vertex cover and set packing problems. Disc. Appl. Math. 6 (1983), 243-254
15. Karger, D., Motwani, R., and Sudan, M. Approximate graph coloring by semidefinite programming. J. ACM 45 (1998), 246-265
16. Khanna, S., Linial, N., and Safra, S. On the hardness of approximating the chromatic number. In Proc. 1st Israel Symp. on Theory of Computing and Systems (1992), IEEE Computer Society, pp. 250-260
17. Leighton, F. Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Mateo, CA, 1992
18. Lovasz, L. Three short proofs in graph theory. J. Combin. Theory 19 (1975), 269-271
19. Monien, B., and Speckenmeyer, E. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inf. 22 (1985), 115-123
20. Papadimitriou, C. H., and Yannakakis, M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 (1991), 425-440
21. Trevisan, L. Approximating satisfiable satisfiability problems. In Proc. 5th Ann. European Symp. on Algorithms (1997), Springer-Verlag, pp. 472-485
22. Zwick, U. Approximation algorithms for constraint satisfaction problems involv- ing at most three variables per constraint. In Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms (1998), ACM-SIAM, p. 201.