The complexity of minimum ratio spanning tree problems (Q2574099): 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.1007/s10898-004-5119-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044266092 / rank | |||
Normal rank | |||
Revision as of 02:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of minimum ratio spanning tree problems |
scientific article |
Statements
The complexity of minimum ratio spanning tree problems (English)
0 references
16 November 2005
0 references
Combinatorial optimization
0 references
Fractional programming
0 references
NP-hard
0 references
