A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710496893715 |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 11:25, 15 March 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
