Hypergraphic LP relaxations for Steiner trees (Q3569832)
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: Hypergraphic LP relaxations for Steiner trees |
scientific article; zbMATH DE number 6181927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hypergraphic LP relaxations for Steiner trees |
scientific article; zbMATH DE number 6181927 |
Statements
Hypergraphic LP Relaxations for Steiner Trees (English)
0 references
22 June 2010
0 references
27 June 2013
0 references
Steiner tree problem
0 references
network design
0 references
linear programming
0 references
approximation algorithm
0 references
integrality gaps
0 references
hypergraphs
0 references
uncrossing method
0 references
0.9628259539604188
0 references
0.9274802207946776
0 references
0.8902527093887329
0 references
0.8743001818656921
0 references
0.8739628791809082
0 references
