A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:01, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the mini-max spanning forest problem |
scientific article |
Statements
A branch-and-bound algorithm for the mini-max spanning forest problem (English)
0 references
27 April 1999
0 references
min-max spanning forest problem
0 references
undirected graph
0 references
NP-hard
0 references
lower bounds
0 references
branch-and-bound
0 references
