Sciweavers

    145
    Voted
    STOC
    2007
    ACM
    91views Algorithms» more  STOC 2007»
    Polynomial flow-cut gaps and hardness of directed cut problems
    16 years 7 months ago
    Polynomial flow-cut gaps and hardness of directed cut problems
    Download  www.cis.upenn.edu
    Julia Chuzhoy, Sanjeev Khanna
    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.