A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width (Q6487362)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width |
scientific article; zbMATH DE number 7630867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width |
scientific article; zbMATH DE number 7630867 |
Statements
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width (English)
0 references
9 December 2022
0 references
0 references
0.8724333643913269
0 references
0.7526979446411133
0 references
0.7519710659980774
0 references
0.7506391406059265
0 references
0.7436455488204956
0 references
