A polynomial-time approximation scheme for embedding hypergraph in a cycle (Q4962786)
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: A polynomial-time approximation scheme for embedding hypergraph in a cycle |
scientific article; zbMATH DE number 6972954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation scheme for embedding hypergraph in a cycle |
scientific article; zbMATH DE number 6972954 |
Statements
A polynomial-time approximation scheme for embedding hypergraph in a cycle (English)
0 references
5 November 2018
0 references
hypergraph embedding
0 references
NP-hardness
0 references
minimum congestion
0 references
polynomial-time approximation scheme
0 references
