A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-and-bound algorithm for the mini-max spanning forest problem |
scientific article; zbMATH DE number 1255843
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the mini-max spanning forest problem |
scientific article; zbMATH DE number 1255843 |
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
0 references
