Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem (Q3120785): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2739849971 / rank | |||
Normal rank |
Revision as of 20:50, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem |
scientific article |
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