Approximation algorithm for partial set multicover versus full set multicover (Q4634530): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xiao-hui Huang / rank
Normal rank
 
Property / author
 
Property / author: Xiao-hui Huang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Homogeneous Weights for Approximating the Partial Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of approximation algorithms / 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: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local ratio method on partial set multi-cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for partial positive influence problem in social network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved performance of the greedy algorithm for partial cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive Influence Dominating Set in Online Social Networks / 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: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET / rank
 
Normal rank
Property / cites work
 
Property / cites work: FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s179383091850026x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2786639653 / rank
 
Normal rank

Latest revision as of 09:39, 30 July 2024

scientific article; zbMATH DE number 6857916
Language Label Description Also known as
English
Approximation algorithm for partial set multicover versus full set multicover
scientific article; zbMATH DE number 6857916

    Statements

    Approximation algorithm for partial set multicover versus full set multicover (English)
    0 references
    0 references
    0 references
    10 April 2018
    0 references
    partial set multicover
    0 references
    greedy algorithm
    0 references
    performance ratio
    0 references

    Identifiers