A simple local 3-approximation algorithm for vertex cover (Q987844): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101781054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distributed Complexity of Computing Maximal Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Distributed Weighted Matchings on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leveraging Linial’s Locality Limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming without the matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Weighted Matching / rank
 
Normal rank

Latest revision as of 02:53, 3 July 2024

scientific article
Language Label Description Also known as
English
A simple local 3-approximation algorithm for vertex cover
scientific article

    Statements

    A simple local 3-approximation algorithm for vertex cover (English)
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    distributed computing
    0 references
    graph algorithms
    0 references
    local algorithms
    0 references
    0 references