Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs (Q4210164): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / 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: Q4228484 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A parallel approximation algorithm for positive linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the ratio of optimal integral and fractional covers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank |
Revision as of 15:10, 28 May 2024
scientific article; zbMATH DE number 1200803
Language | Label | Description | Also known as |
---|---|---|---|
English | Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs |
scientific article; zbMATH DE number 1200803 |
Statements
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs (English)
0 references
21 September 1998
0 references
algorithms
0 references
set cover
0 references
primal-dual
0 references
parallel
0 references
approximation
0 references
voting lemmas
0 references