PDF-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
Download Presentation
"Detecting High LogDensities an Approximation for Densest S " is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.