Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1287/ijoc.2020.0975 / rank | |||
Property / DOI | |||
Property / DOI: 10.1287/IJOC.2020.0975 / rank | |||
Normal rank |
Latest revision as of 15:33, 30 December 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
23 June 2021
0 references
partial set multicover
0 references
minimum \(k\) union
0 references
approximation algorithm
0 references
0 references
0 references