On-line and off-line approximation algorithms for vector covering problems (Q4595502)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6815408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line and off-line approximation algorithms for vector covering problems |
scientific article; zbMATH DE number 6815408 |
Statements
On-line and off-line approximation algorithms for vector covering problems (English)
0 references
5 December 2017
0 references
approximation algorithm
0 references
worst-case ratio
0 references
packing problem
0 references
covering problem
0 references
online algorithm
0 references
0.996673047542572
0 references
0.996673047542572
0 references
0.8116174936294556
0 references
0.8084717988967896
0 references
