Detecting High LogDensities an Approximation for Densest Subgraph Aditya Bhaskara Moses Charikar Eden Chlamtac Uriel Feige Aravindan Vijayaraghavan Abstract In the Densest Subgraph problem given a
There is a signi64257cant gap between the best known upper and lower bounds for this problem It is NPhard and does not have a PTAS unless NP has subexponential time algorithms On the other hand the current best known algorithm of Feige Kortsarz and
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Detecting High LogDensities an Approxi..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.