Sciweavers

    158
    Voted
    SPAA
    2010
    ACM
    282views Distributed And Parallel Com...» more  SPAA 2010»
    Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
    15 years 7 months ago
    Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
    Download  www.cs.helsinki.fi
    We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
    Matti Åstrand, Jukka Suomela
    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.