A dynamic edge covering and scheduling problem: complexity results and approximation algorithms (Q2448193)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic edge covering and scheduling problem: complexity results and approximation algorithms |
scientific article |
Statements
A dynamic edge covering and scheduling problem: complexity results and approximation algorithms (English)
0 references
30 April 2014
0 references
endpoint covering
0 references
scheduling
0 references
complexity
0 references
approximation algorithms
0 references
