Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003)
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 7567460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum hitting set of interval bundles problem: computational complexity and approximability |
scientific article; zbMATH DE number 7567460 |
Statements
Minimum hitting set of interval bundles problem: computational complexity and approximability (English)
0 references
3 August 2022
0 references
hitting set
0 references
approximation algorithms
0 references
maintenance scheduling
0 references
0 references
0.8571475744247437
0 references
0.8525861501693726
0 references
0.7417214512825012
0 references
0.7416067123413086
0 references
0.7280999422073364
0 references
