On-line and off-line approximation algorithms for vector covering problems (Q4595502): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-61680-2_71 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151007052 / rank | |||
Normal rank | |||
Latest revision as of 19:56, 19 March 2024
scientific article; zbMATH DE number 6815408
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
