Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem (Q3120785)
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 7038022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem |
scientific article; zbMATH DE number 7038022 |
Statements
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem (English)
0 references
19 March 2019
0 references
maximum-weight connected subgraph problem
0 references
prize-collecting Steiner tree problem
0 references
reduction techniques
0 references
rooted prize-collecting Steiner tree problem
0 references
Steiner tree problem
0 references
Steiner tree reductions
0 references
0.8589878082275391
0 references
0.8263412714004517
0 references
0.8146461844444275
0 references
0.8128341436386108
0 references
