Sciweavers

    7 search results - page 2 / 2
    » On the Hardness of Approximating Multicut and Sparsest-Cut
    Sort
    View
    APPROX
    2010
    Springer
    154views Algorithms» more  APPROX 2010»
    The Checkpoint Problem
    13 years 6 months ago
    The Checkpoint Problem
    Download  crab.rutgers.edu
    In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
    MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
    claim paper
    Read More »
    STOC
    2009
    ACM
    150views Algorithms» more  STOC 2009»
    Integrality gaps for Sherali-Adams relaxations
    14 years 5 months ago
    Integrality gaps for Sherali-Adams relaxations
    Download  www.cs.princeton.edu
    We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
    Moses Charikar, Konstantin Makarychev, Yury Makary...
    claim paper
    Read More »
    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.