A polynomial-time approximation to a minimum dominating set in a graph (Q2166772): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114129071, #quickstatements; #temporary_batch_1709751086066
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3204841430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the k-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Geometric Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Fault-Tolerant Domination in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential time algorithms for the minimum dominating set problem on some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / 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: Dominating sets in social network graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a series-parallel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a greedy heuristic for finding small dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The secure domination problem in cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy domination on biclique-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function / rank
 
Normal rank

Latest revision as of 23:38, 29 July 2024

scientific article
Language Label Description Also known as
English
A polynomial-time approximation to a minimum dominating set in a graph
scientific article

    Statements

    A polynomial-time approximation to a minimum dominating set in a graph (English)
    0 references
    25 August 2022
    0 references
    graph
    0 references
    dominating set
    0 references
    approximation ratio
    0 references
    approximation algorithm
    0 references
    time complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers