Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dominating Sets and Independent Sets of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum monopoly in regular and tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal File Sharing in Distributed Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local majorities, coalitions and monopolies in graphs: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: On positive influence dominating sets in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS / rank
 
Normal rank

Latest revision as of 10:27, 4 July 2024

scientific article
Language Label Description Also known as
English
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs
scientific article

    Statements

    Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references