TY - GEN

T1 - On choosing a dense subgraph

AU - Kortsarz, Guy

AU - Peleg, David

PY - 1993

Y1 - 1993

N2 - This paper concerns the problem of computing the densest k-vertex subgraph of a given graph, namely, the subgraph with the most edges, or with the highest edges-to-vertices ratio. A sequence of approximation algorithms is developed for the problem, with each step yielding a better ratio at the cost of a more complicated solution. The approximation ratio of our final algorithm is O(n0.3885). We also present a method for converting an approximation algorithm for an unweighted graph problem (from a specific class of maximization problems) into one for the corresponding weighted problem, and apply it to the densest subgraph problem.

AB - This paper concerns the problem of computing the densest k-vertex subgraph of a given graph, namely, the subgraph with the most edges, or with the highest edges-to-vertices ratio. A sequence of approximation algorithms is developed for the problem, with each step yielding a better ratio at the cost of a more complicated solution. The approximation ratio of our final algorithm is O(n0.3885). We also present a method for converting an approximation algorithm for an unweighted graph problem (from a specific class of maximization problems) into one for the corresponding weighted problem, and apply it to the densest subgraph problem.

UR - http://www.scopus.com/inward/record.url?scp=0027837685&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0027837685

SN - 0818643706

T3 - Annual Symposium on Foundatons of Computer Science (Proceedings)

SP - 692

EP - 701

BT - Annual Symposium on Foundatons of Computer Science (Proceedings)

A2 - Anon, null

PB - Publ by IEEE

T2 - Proceedings of the 34th Annual Symposium on Foundations of Computer Science

Y2 - 3 November 1993 through 5 November 1993

ER -