Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem (Q3120785): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/net.21857 / rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SCIP / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SCIP-Jack / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2739849971 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129034108 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/NET.21857 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:54, 20 December 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