Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (Q4686678): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.21825 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2800659169 / rank | |||
Normal rank | |||
Revision as of 18:34, 19 March 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
