A heuristic algorithm for the mini-max spanning forest problem (Q1278250): 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.1016/0377-2217(94)00335-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973984239 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3056948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: `` Strong '' NP-Completeness Results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the History of the Minimum Spanning Tree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
Latest revision as of 17:30, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic algorithm for the mini-max spanning forest problem |
scientific article |
Statements
A heuristic algorithm for the mini-max spanning forest problem (English)
0 references
27 April 1999
0 references
spanning forest
0 references
mini-max problem
0 references
heuristics
0 references
graph theory
0 references
