Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827)
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: Degree-Constrained Subgraph Problems: Hardness and Approximation Results |
scientific article; zbMATH DE number 5507770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree-Constrained Subgraph Problems: Hardness and Approximation Results |
scientific article; zbMATH DE number 5507770 |
Statements
Degree-Constrained Subgraph Problems: Hardness and Approximation Results (English)
0 references
12 February 2009
0 references
approximation algorithms
0 references
degree-constrained subgraphs
0 references
hardness of approximation
0 references
APX
0 references
PTAS
0 references
excluded minor
0 references
0.97482806
0 references
0.9433527
0 references
0.93038017
0 references
0.92980707
0 references
0.9199205
0 references
0.9191309
0 references
0 references
0.9099777
0 references
0.9027284
0 references
