Sciweavers

    STOC
    2010
    ACM
    186views Algorithms» more  STOC 2010»

    Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph

    13 years 2 months ago
    Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph
    Download  www.cs.princeton.edu
    Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Ur
    claim paper
    Added 30 Jan 2011
    Updated 30 Jan 2011
    Type Journal
    Year 2010
    Where STOC
    Authors Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan
    Comments (0)
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.