Sciweavers

    CORR
    2008
    Springer
    169views Education» more  CORR 2008»
    Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
    14 years 20 days ago
    Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
    Download  www.cse.cuhk.edu.hk
    For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
    Mingyu Xiao, Leizhen Cai, Andrew C. Yao
    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.