Approximating minimum-cost graph problems with spanning tree edges (Q1892100): 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.1016/0167-6377(94)90067-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047085423 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating minimum-cost graph problems with spanning tree edges |
scientific article |
Statements
Approximating minimum-cost graph problems with spanning tree edges (English)
0 references
6 July 1995
0 references
NP-hard minimum-cost graph problems
0 references
minimum-cost spanning tree
0 references
2- matching
0 references
location-routing problems
0 references
