Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (Q4686678): 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.21825 / rank | |||
Property / author | |||
Property / author: Yi-Ming Wang / rank | |||
Property / author | |||
Property / author: Q200487 / rank | |||
Property / author | |||
Property / author: Yi-Ming Wang / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Sergiy I. Butenko / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129937337 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/NET.21825 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
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