On choosing a dense subgraph

Guy Kortsarz, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

110 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundatons of Computer Science (Proceedings)
Editors Anon
PublisherPubl by IEEE
Pages692-701
Number of pages10
ISBN (Print)0818643706
StatePublished - 1993
Externally publishedYes
EventProceedings of the 34th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA
Duration: 3 Nov 19935 Nov 1993

Publication series

NameAnnual Symposium on Foundatons of Computer Science (Proceedings)
ISSN (Print)0272-5428

Conference

ConferenceProceedings of the 34th Annual Symposium on Foundations of Computer Science
CityPalo Alto, CA, USA
Period3/11/935/11/93

Fingerprint

Dive into the research topics of 'On choosing a dense subgraph'. Together they form a unique fingerprint.

Cite this