The dense k-subgraph problem

Algorithmica (New York)

Volumn 29, Issue 3, 2001, Pages 410-421

  Feige, U ^a   Kortsarz, G ^b   Peleg, D ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Approximation algorithms; Dense subgraph

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

DENSE SUBGRAPHS;

GRAPH THEORY;

EID: 0005259971     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010050     Document Type: Article

References (11)

1. N. Alon, U. Feige, A. Wigderson, and D. Zuckerman. Derandomized graph products. Comput. Complexity, 5:60-75, 1995.
2. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. Proc. 27th Symp. on Theory of Computing, pp. 284-293. ACM, New York, 1995.
3. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. In SWAT 96, pp. 136-148. LNCS 1097. Springer-Verlag, Berlin, 1996.
4. N. Biggs. Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge, 1993.
5. U. Feige and M. Seltser. On the Densest k-Subgraph Problem. Technical Report CS97-16, Weizmann Institute, Rehovot, 1997. Available at http://www.wisdom.weizmann.ac.il.
6. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Comput., 18:30-55, 1989.
7. R. Hassin, S. Rubinstein, and A. Tamir. Approximation algorithms for maximum dispersion. Oper. Res. Lett., 21:133-137, 1997.
8. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
9. F. T. Leighton and S. Rao. An approximate Max-Flow Min-Cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Proc. 29th Symp. on Foundations of Computer Science, pp. 422-431. IEEE, New York, 1988.
10. M. Marcus and H. Minc. A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston, MA, 1964.
11. S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Heuristic and special case algorithms for dispersion problems. Oper. Res., 42(2):299-310, 1994.