On minimizing the maximum congestion for weighted hypergraph embedding in a cycle (Q1014437)
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 5547811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On minimizing the maximum congestion for weighted hypergraph embedding in a cycle |
scientific article; zbMATH DE number 5547811 |
Statements
On minimizing the maximum congestion for weighted hypergraph embedding in a cycle (English)
0 references
28 April 2009
0 references
algorithmical approximation
0 references
algorithms
0 references
hypergraph
0 references
LP-relaxation
0 references
NP-complete
0 references
0.9196154475212096
0 references
0.9136691689491272
0 references
0.891883373260498
0 references
0.8652799725532532
0 references
0.8644524812698364
0 references
