Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design (Q2944499): Difference between revisions
From MaRDI portal
Added link to MaRDI 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 / Wikidata QID | |||
| Property / Wikidata QID: Q56077951 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1103963.1103967 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004240896 / rank | |||
Normal rank | |||
Latest revision as of 02:24, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design |
scientific article |
Statements
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design (English)
0 references
2 September 2015
0 references
spanning trees
0 references
approximation algorithms
0 references
minimum spanning trees
0 references
network design
0 references
