On bicriterion minimal spanning trees: An approximation (Q1360130): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(96)00026-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046984978 / rank | |||
Normal rank | |||
Latest revision as of 08:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On bicriterion minimal spanning trees: An approximation |
scientific article |
Statements
On bicriterion minimal spanning trees: An approximation (English)
0 references
15 July 1997
0 references
set of efficient spanning trees
0 references
heuristics
0 references
neighbourhood search
0 references
adjacent search
0 references
