Abstract
The analysis of algorithms on semirandom graph instances intermediates smoothly between the analysis in the worst case and the average case. The aim of this paper is to present an algorithm for finding a large independent set in a semirandom graph in polynomial expected time, thereby extending the work of Feige and Kilian [4]. In order to preprocess the input graph, the algorithm makes use of SDP-based techniques. The analysis of the algorithm shows that not only is the expected running time polynomial, but even arbitrary moments of the running time are polynomial in the number of vertices of the input graph. The algorithm for the independent set problem yields an algorithm for k-coloring semirandom k-colorable graphs, and for the latter algorithm a similar result concerning its running time holds, as also for the independent set algorithm. The results on both problems are essentially best-possible, by the hardness results obtained in [4].
Research supported by the Deutsche Forschungsgemeinschaft (grant DFG FOR 413/1-1)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Kahale, N.: Approximating the independence number via the ϑ-function. Math. Programming 80 (1998) 253–264.
Blum, A., Spencer, J.: Coloring random and semirandom k-colorable graphs. J. of Algorithms 19(2) (1995) 203–234
Coja-Oghlan, A.: Zum Färben k-färbbarer semizufälliger Graphen in erwarteter Polynomzeit mittels Semidefiniter Programmierung. Technical Report 141, Fachbereich Mathematik der Universität Hamburg (2002)
Feige, U., Kilian, J.: Heuristics for semirandom graph problems. preprint (2000)
Garey, M.R., Johnson, D.S.: Computers and intractability. W.H. Freeman and Company 1979
Håstad, J.: Clique is hard to approximate within n1-ε. Proc. 37th Annual Symp. on Foundations of Computer Science (1996) 627–636
Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. Proc. of the 35th. IEEE Symp. on Foundations of Computer Science (1994) 2–13
Khanna, S., Linial, N., Safra, S.: On the hardness of approximating the chromatic number, Proc. 2nd Israeli Symp. on Theory and Computing Systems (1992) 250–260
Mahajan, S., Ramesh, H.: Derandomizing semidefinite programming based approximation algorithms. Proc. 36th IEEE Symp. on Foundations of Computer Science (1995) 162–169
Subramanian, C.: Minimum coloring random and semirandom graphs in polynomial expected time. Proc. 36th Annual Symp. on Foundations of Computer Science (1995) 463–472
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coja-Oghlan, A. (2002). Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-45687-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44040-6
Online ISBN: 978-3-540-45687-2
eBook Packages: Springer Book Archive