The complexity of minimum ratio spanning tree problems (Q2574099): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: A Class of Fractional Programming Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal ratio spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Nonlinear Fractional Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hyperbolic 0-1 programming and query optimization in information retrieval / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum spanning trees with sums of ratios. / rank | |||
Normal rank | |||
Latest revision as of 13:02, 11 June 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
