Author:
Tirodkar Sumedh,Vishwanathan Sundar
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Alon, N., Jiang, T., Miller, Z., Pritikin, D.: Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Random Struct. Algorithms 23(4), 409–433 (2003)
2. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting High Log-Densities - an
$$O(n^{1/4})$$
Approximation for Densest
$$k$$
-Subgraph. In: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC 2010, pp. 201–210. ACM (2010)
3. Bhaskara, A., Charikar, M., Vijayaraghavan, A., Guruswami, V., Zhou, Y.: Polynomial integrality gaps for strong SDP relaxations of Densest
$$k$$
-subgraph. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 388–405. SIAM (2012)
4. Camacho, S.M., Schiermeyer, I., Tuza, Z.: Approximation algorithms for the minimum rainbow subgraph problem. Discrete Math. 310(20), 2666–2670 (2010). Graph Theory - Dedicated to Carsten Thomassen on his 60th Birthday
5. Charikar, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for label cover problems. Algorithmica 61(1), 190–206 (2011)