Greedily Finding a Dense Subgraph

Journal of Algorithms

Volumn 34, Issue 2, 2000, Pages 203-221

  Asahiro, Yuichi ^a   Iwama, Kazuo ^b   Tamaki, Hisao ^c   Tokuyama, Takeshi ^d  

^a KYUSHU UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c MEIJI UNIVERSITY   (Japan)

^d IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042657622     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1062     Document Type: Article

References (9)

1. Y. Asahiro and K. Iwama, Finding dense subgraphs, in "Proc. International Symposium on Algorithms and Computation '95," Lecture Notes in Computer Science, Vol. 1004, pp. 102-111, Springer-Verlag, Berlin, 1995.
2. S. Arora, D. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in "Proc. 27th ACM Symposium on Theory of Computing," pp. 284-293, 1995.
3. U. Feige and M. Seltser, "On the Densest k-Subgraph Problem," Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehobot, 1997.
4. M. Grötschel and L. Lovász, Combinatorial optimization: A survey, in "Handbook of Combinatorics," North-Holland, Amsterdam, 1995.
5. G. Kortsarz and D. Peleg, Generating sparse 2-spanners, J. Algorithms 17 (1994), 222-236.
6. G. Kortsarz and D. Peleg, On choosing a dense subgraph, in "Proc. 34th IEEE Symposium on Foundations of Computer Science," pp. 692-701, 1993.
7. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci. 37 (1988), 130-143.
8. S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi, Heuristic and special case algorithms for dispersion problems, Oper. Res. 42 (1994), 299-310.
9. A. Srivastav and K. Wolf, Finding dense subgraphs with semidefinite programming, in "Approximation Algorithms for Combinatorial Optimization," Lecture Notes in Computer Science, Vol. 1444, pp. 181-191, Springer-Verlag, Berlin, 1998.