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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2020.0975 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3092807993 / rank
 
Normal rank

Revision as of 21:40, 19 March 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