Sciweavers

    FOCS
    2008
    IEEE
    133views Theoretical Computer Science» more  FOCS 2008»
    Submodular Approximation: Sampling-based Algorithms and Lower Bounds
    16 years 6 days ago
    Submodular Approximation: Sampling-based Algorithms and Lower Bounds
    Download  www.cs.dartmouth.edu
    We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
    Zoya Svitkina, Lisa Fleischer
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.