Sciweavers

    CORR
    2004
    Springer
    104views Education» more  CORR 2004»

    Inapproximability of Combinatorial Optimization Problems

    13 years 11 months ago
    Inapproximability of Combinatorial Optimization Problems
    Download  www.cs.berkeley.edu
    We survey results on the hardness of approximating combinatorial optimization problems. Contents
    Luca Trevisan
    claim paper
    Added 17 Dec 2010
    Updated 17 Dec 2010
    Type Journal
    Year 2004
    Where CORR
    Authors Luca Trevisan
    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.