Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Public-key cryptography from different assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding dense subgraphs / 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: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Densest $k$-Subhypergraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of positive influence dominating set in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for partial set multicover versus full set multicover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Steiner Networks with Node-Weights / 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: A primal-dual algorithm for the minimum partial set multi-cover problem / 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: A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for the partial set multi-cover problem / 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

Revision as of 00:58, 26 July 2024

scientific article; zbMATH DE number 7362346
Language Label Description Also known as
English
Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
scientific article; zbMATH DE number 7362346

    Statements

    Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2021
    0 references
    partial set multicover
    0 references
    minimum \(k\) union
    0 references
    approximation algorithm
    0 references

    Identifiers