Further approximations for demand matching: matroid constraints and minor-closed graphs (Q5111386)
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 7204507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Further approximations for demand matching: matroid constraints and minor-closed graphs |
scientific article; zbMATH DE number 7204507 |
Statements
27 May 2020
0 references
approximation algorithms
0 references
column-restricted packing
0 references
demand matching
0 references
matroids
0 references
planar graphs
0 references
0.8249199986457825
0 references
0.8007816672325134
0 references
0.7759346961975098
0 references
0.7653179168701172
0 references
