A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (Q4943844): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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.1137/s009753979732253x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3138832177 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:26, 30 July 2024
scientific article; zbMATH DE number 1417065
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees |
scientific article; zbMATH DE number 1417065 |
Statements
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (English)
0 references
19 March 2000
0 references
approximation algorithms
0 references
network design
0 references
spanning trees
0 references
computational biology
0 references
