Approximation algorithms via contraction decomposition (Q1945289): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:57, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms via contraction decomposition |
scientific article |
Statements
Approximation algorithms via contraction decomposition (English)
0 references
5 April 2013
0 references
graphs of bounded (Euler) genus
0 references
contracting edges
0 references
graphs of bounded treewidth
0 references
obtaining PTASs for contraction-closed problems
0 references
