Sciweavers

    JCT
    2006
    100views more  JCT 2006»
    Approximating clique-width and branch-width
    13 years 11 months ago
    Approximating clique-width and branch-width
    Download  www.math.princeton.edu
    We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
    Sang-il Oum, Paul D. Seymour
    claim paper
    Read More »
    FOCS
    2007
    IEEE
    132views Theoretical Computer Science» more  FOCS 2007»
    Maximizing Non-Monotone Submodular Functions
    14 years 5 months ago
    Maximizing Non-Monotone Submodular Functions
    Download  www.math.princeton.edu
    Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
    Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
    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.