A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (Q3587351)
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 5780410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time approximation scheme for embedding hypergraph in a weighted cycle |
scientific article; zbMATH DE number 5780410 |
Statements
A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle (English)
0 references
7 September 2010
0 references
hypergraph embedding
0 references
weighted cycle
0 references
minimum congestion
0 references
NP-hard
0 references
polynomial time approximation scheme
0 references
0.967306673526764
0 references
0.9462063908576964
0 references
0.9101184606552124
0 references
0.891883373260498
0 references
0.8788796663284302
0 references
