On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q2969617)
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 6696504
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree |
scientific article; zbMATH DE number 6696504 |
Statements
22 March 2017
0 references
Steiner tree
0 references
bidirected cut relaxation
0 references
hypergraphic relaxation
0 references
polyhedral equivalence
0 references
approximation algorithms
0 references
0.9977622628211976
0 references
0.9776031374931335
0 references
0.8660843968391418
0 references
