Abstract.
This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n δ ) , for some δ < 1/3 .
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 29, 1997; revised June 26, 1998, and April 13, 1999.
Rights and permissions
About this article
Cite this article
Feige, U., Peleg, D. & Kortsarz, G. The Dense k -Subgraph Problem . Algorithmica 29, 410–421 (2001). https://doi.org/10.1007/s004530010050
Issue Date:
DOI: https://doi.org/10.1007/s004530010050