Parameterized approximability of maximizing the spread of influence in networks (Q2250539): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2014.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119218916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms and Hardness for Domination with Propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Inapproximability of Target Set Selection and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth governs the complexity of target set selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximation Algorithms for Densest k-Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spreading messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Influence in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Thresholds Can Make Target Set Selection Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The importance of being biased / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Syntactic versus Computational Views of Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractable Cases of Target Set Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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: Variants of Spreading Messages / rank
 
Normal rank

Latest revision as of 17:17, 8 July 2024

scientific article
Language Label Description Also known as
English
Parameterized approximability of maximizing the spread of influence in networks
scientific article

    Statements

    Parameterized approximability of maximizing the spread of influence in networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 July 2014
    0 references
    parameterized complexity
    0 references
    approximation
    0 references
    parameterized approximation
    0 references
    target set selection
    0 references
    dynamic monopolies
    0 references
    spread of information
    0 references
    viral marketing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references