A deterministic approximation algorithm for the Densest k-Subgraph Problem

International Journal of Operational Research

Volumn 3, Issue 3, 2008, Pages 301-314

  Roupin, Frédéric ^a   Billionnet, Alain ^a  

^a CEDRIC   (France)

Author keywords

Approximation; Complexity; Linear programming; Quadratic programming

Indexed keywords

EID: 41049093086     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2008.017534     Document Type: Article

References (19)

1. Asahiro,Y., Iwama, K., Tamaki, H. and Tokuyama, T. (2000) 'Greedily finding a dense subgraph', Journal of Algorithms, Vol. 34, pp.203-221.
2. Arora, S., Karger, D. and Karpinski, M. (1999) 'Polynomial time approximation schemes for dense instances of NP-hard problems', Journal of Computer and System Sciences, Vol. 58, pp.193-210.
3. Corneil, D.G. and Perl, Y. (1984) 'Clustering and domination in perfect graphs', Discrete Applied Mathematics, Vol. 9, pp.7-39.
4. Feige, U. and Langberg, M. (2001a) 'Approximation algorithms for maximization problems arising in graph partitioning', Journal of Algorithms, Vol. 41, pp.174-211.
5. 2 rounding technique for semidefinite programmes', ICALP'2001, Crete, Greece, Lecture Notes in Computer Science (No. 2076, pp.213-224). Berlin: Springer.
6. Feige, U., Kortsarz, G. and Peleg, D. (2001) 'The Dense k-Subgraph Problem', Algorithmica, Vol. 29, pp.410-421.
7. Goemans, X. and Williamson, D.P. (1995) 'Improved approximation algorithms for maximum-cut and satisfiability problems using semidefinite programming', Journal of ACM, Vol. 42, pp.1115-1145.
8. Han, Q., Ye, Y. and Zhang, J. (2000) 'Approximation of Dense-k Subgraph', Working Paper, Department of Management Sciences, Henry B. Tippie College of Business, The University of Iowa, Iowa City, IA 52242, USA.
9. Han, Q., Ye, Y. and Zhang, J. (2002) 'An improved rounded method and semidefinite programming relaxation for graph partition', Mathematical Programming, Vol. 92, pp.509-535.
10. Hassin, R., Rubinstein, S. and Tamir, A. (1997) 'Approximation algorithms for maximum dispersion', Operations Research Letters, Vol. 21, pp.133-137.
11. Jäger, G. and Srivastav, A. (2005) 'Improved approximation algorithms for maximum graph partitioning problems', Journal of Combinatorial Optimization, Vol. 10, pp. 133-167.
12. Kortsarz, G. and Peleg, D. (1993) 'On choosing a dense subgraph', 34th Annual IEEE Symposium on Foundations of Computer Science (pp.692-701). Palo Alto, California.
13. Krarup, J., Pisinger, D. and Plastria, F. (2002) 'Discrete location problems with push-pull objectives', Discrete Applied Mathematics, Vol. 123, pp.363-378.
14. Mahajan, S. and Hariharan, R. (1999) 'Derandomizing approximation algorithms based on semidefinite programming', SIAM Journal on Computing, Vol. 28, pp.1641-1663.
15. Raghavan, P. (1988) 'Probabilistic construction of deterministic algorithms. Approximate packing integer problems', Journal of Computer and System Sciences, Vol. 37, pp.130-143.
16. Raghavan, P. and Thompson, C. (1987) 'Randomized Rounding: A technique for provably good algorithms and algorithmic proofs. Probabilistic construction of deterministic algorithms', Combinatorica, Vol. 7, pp.365-374.
17. Srivastav, A. (2001) 'Derandomization in Combinatorial Optimization', in P.M. Pardalos, S. Rajasekaran, J.H. Reif and R.J. Rolim (Eds), Handbook of Randomized Computing, Vol. 2, pp.731-842. Dordrecht, The Netherlands: Kluwer Academic Publishers.
18. Srivastav, A. and Wolf, K. (1998) 'Finding Dense Subgraphs with Semidefinite Programming', International Workshop on Approximation '98, Lecture Notes in Computer Science, Vol. 1444, pp.181-191.
19. Srivastav, A. and Wolf, K. (1999) 'Erratum on Finding Dense Subgraphs with Semidefinite Programming', Preprint, Mathematisches Seminar, Universitaet zu Kiel (An erratum).