Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (Q4686678): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129937337, #quickstatements; #temporary_batch_1726341741784 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.21825 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.21825 / rank | |||
Normal rank | |||
Latest revision as of 15:04, 30 December 2024
scientific article; zbMATH DE number 6947041
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph |
scientific article; zbMATH DE number 6947041 |
Statements
Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (English)
0 references
4 October 2018
0 references
fixed-parameter tractable
0 references
maximum weight connected subgraph
0 references
node-weighted Steiner tree
0 references
Steiner tree
0 references
strong exponential time hypothesis
0 references
