A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (Q650915)
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 weighted cycle |
scientific article; zbMATH DE number 5987004
| 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 5987004 |
Statements
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle (English)
0 references
7 December 2011
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.9277791380882264
0 references
0.8903563618659973
0 references
0.8875437378883362
0 references
0.8684075474739075
0 references
