Sciweavers

    545 search results - page 4 / 109
    » Simultaneous approximation by greedy algorithms
    Sort
    View
    DCC
    2004
    IEEE
    126views Computer Graphics» more  DCC 2004»
    An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
    14 years 7 months ago
    An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
    Download  www.eecs.harvard.edu
    We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
    Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
    claim paper
    Read More »
    STOC
    2005
    ACM
    174views Algorithms» more  STOC 2005»
    On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
    14 years 7 months ago
    On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
    Download  www.math.cmu.edu
    In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
    Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
    claim paper
    Read More »
    CORR
    2008
    Springer
    169views Education» more  CORR 2008»
    Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
    13 years 7 months 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 »
    DAM
    2006
    75views more  DAM 2006»
    A greedy approximation algorithm for the group Steiner problem
    13 years 7 months ago
    A greedy approximation algorithm for the group Steiner problem
    Download  www-math.mit.edu
    Chandra Chekuri, Guy Even, Guy Kortsarz
    claim paper
    Read More »
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    Yet another algorithm for dense max cut: go greedy
    13 years 8 months ago
    Yet another algorithm for dense max cut: go greedy
    Download  www.cs.brown.edu
    We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
    Claire Mathieu, Warren Schudy
    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.