This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
34th Annual Symposium on Foundations of Computer Science (FOCS 1993)
Palo Alto, CA, USA
November 03-November 05
ISBN: 0-8186-4370-6
ASCII Text
x 
 
G. Kortsarz, D. Peleg, "On choosing a dense subgraph," Foundations of Computer Science, IEEE Annual Symposium on, pp. 692-701, 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), 1993.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.1993.366818,
author = {G. Kortsarz and D. Peleg},
title = {On choosing a dense subgraph},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1993},
isbn = {0-8186-4370-6},
pages = {692-701},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1993.366818},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - On choosing a dense subgraph
SN - 0-8186-4370-6
SP692
EP701
A1 - G. Kortsarz,
A1 - D. Peleg,
PY - 1993
KW - weighted problem
KW - dense subgraph
KW - densest k-vertex subgraph
KW - most edges
KW - edges-to-vertices ratio
KW - approximation algorithms
KW - approximation ratio
KW - unweighted graph problem
KW - maximization problems
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
G. Kortsarz, Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
D. Peleg, Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
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/spl tilde/(n/sup 0.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.
Index Terms:
weighted problem, dense subgraph, densest k-vertex subgraph, most edges, edges-to-vertices ratio, approximation algorithms, approximation ratio, unweighted graph problem, maximization problems
Citation:
G. Kortsarz, D. Peleg, "On choosing a dense subgraph," focs, pp.692-701, 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), 1993
Usage of this product signifies your acceptance of the Terms of Use.