Referenced Items are not available for this document.
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
Published in:
Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
Date of Conference: 3-5 Nov 1993
- Page(s):
- 692 - 701
- Meeting Date :
- 03 Nov 1993-05 Nov 1993
- Print ISBN:
- 0-8186-4370-6
- INSPEC Accession Number:
- 4858036
- Conference Location :
- Palo Alto, CA
- Digital Object Identifier :
- 10.1109/SFCS.1993.366818
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
