Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (Q1641150)
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: Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces |
scientific article; zbMATH DE number 6889953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces |
scientific article; zbMATH DE number 6889953 |
Statements
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (English)
0 references
15 June 2018
0 references
subgraphs
0 references
stock piece
0 references
bin-packing
0 references
approximation algorithms
0 references
APTAS
0 references
0.8697171807289124
0 references
0.8134241104125977
0 references
0.7905303835868835
0 references
0.7531850337982178
0 references
0.746616542339325
0 references
