Computing optimal Steiner trees in polynomial space (Q2392926): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-012-9612-z / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/algorithmica/FominGKLS13 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-012-9612-Z / rank | |||
Normal rank | |||
Latest revision as of 09:22, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing optimal Steiner trees in polynomial space |
scientific article |
Statements
Computing optimal Steiner trees in polynomial space (English)
0 references
5 August 2013
0 references
Steiner tree
0 references
exact algorithms
0 references
space complexity
0 references
0 references
0 references
