Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-30139-6_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2491529644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On min-max \(r\)-gatherings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local 2-Approximation Algorithm for the Vertex Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the capacitated \(b\)-edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for generalized edge dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerate and Measure: Improving Parameter Budget Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of edge dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: edge dominating set: Efficient Enumeration-Based Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Curse of Connectivity: t-Total Vertex (Edge) Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge covers with clustering properties: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for local approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Edge Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple local 3-approximation algorithm for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating edge dominating set in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge domination on bipartite permutation graphs and cotriangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for edge dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New parameterized algorithms for the edge dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:35, 11 July 2024

scientific article
Language Label Description Also known as
English
Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers
scientific article

    Statements

    Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (English)
    0 references
    0 references
    0 references
    3 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references