PDF-Detecting High LogDensities an Approximation for Densest Subgraph Aditya Bhaskara Moses PDF document

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

Upload by phoebe-click
Published on 2015-01-18

Presentation Embed Code

<iframe width="560" height="315" src="https://www.docslides.com/embed/32840" frameborder="0" allowfullscreen></iframe>

Download Presentation

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 web site 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.