Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870)
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 2083797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong lower bounds for the prize collecting Steiner problem in graphs |
scientific article; zbMATH DE number 2083797 |
Statements
Strong lower bounds for the prize collecting Steiner problem in graphs (English)
0 references
6 August 2004
0 references
Prize collecting Steiner problem in graphs
0 references
Linear programming relaxation
0 references
Lower bound
0 references
0 references
0.9215294122695924
0 references
0.8552147746086121
0 references
0.8228177428245544
0 references
0.8159251809120178
0 references
0.8159192204475403
0 references
