Sciweavers

    2 search results - page 1 / 1
    » An Improved Analysis for a Greedy Remote-Clique Algorithm Us...
    Sort
    View
    APPROX
    2006
    Springer
    72views Algorithms» more  APPROX 2006»
    An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
    15 years 8 months ago
    An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
    Download  www.cs.washington.edu
    Benjamin E. Birnbaum, Kenneth J. Goldman
    claim paper
    Read More »
    FCT
    2007
    Springer
    123views Applied Computing» more  FCT 2007»
    Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
    15 years 10 months ago
    Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
    Download  www.ceid.upatras.gr
    We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
    Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.