Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192)
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 7595917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for constructing required subgraphs using stock pieces of fixed length |
scientific article; zbMATH DE number 7595917 |
Statements
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (English)
0 references
4 October 2022
0 references
subgraph constructions
0 references
stock pieces of length \(L\)
0 references
bin packing
0 references
approximation algorithms
0 references
AFPTAS
0 references
0 references
0.8697171807289124
0 references
0.8209176063537598
0 references
0.7853972315788269
0 references
0.7525266408920288
0 references
