Data reductions and combinatorial bounds for improved approximation algorithms (Q899583)
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: Data reductions and combinatorial bounds for improved approximation algorithms |
scientific article; zbMATH DE number 6524669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Data reductions and combinatorial bounds for improved approximation algorithms |
scientific article; zbMATH DE number 6524669 |
Statements
Data reductions and combinatorial bounds for improved approximation algorithms (English)
0 references
30 December 2015
0 references
reduction rules
0 references
maximization problems
0 references
polynomial-time approximation
0 references
domination problems
0 references
0 references
0.9328986406326294
0 references
0.723378598690033
0 references
0.7097616791725159
0 references
0.7073015570640564
0 references
0.7062253952026367
0 references
