Advertisement

Algorithmica

, Volume 29, Issue 3, pp 410–421 | Cite as

The Dense k -Subgraph Problem

  • U. Feige
  • D. Peleg
  • G. Kortsarz
Article

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 .

Key words. Approximation algorithms, Dense subgraph. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2001

Authors and Affiliations

  • U. Feige
    • 1
  • D. Peleg
    • 1
  • G. Kortsarz
    • 2
  1. 1.Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel.IL
  2. 2.Department of Computer Science, The Open University, Tel Aviv, Israel.IL

Personalised recommendations