A class of heuristics for the constrained forest problem (Q2581555): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the complexity of graph tree partition problems. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4738659 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A greedy heuristic for a minimum-weight forest problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Another greedy heuristic for the constrained forest problem / rank | |||
Normal rank | |||
Latest revision as of 14:56, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of heuristics for the constrained forest problem |
scientific article |
Statements
A class of heuristics for the constrained forest problem (English)
0 references
10 January 2006
0 references
Constrained forest problem
0 references
Tree partitioning
0 references
Minimum spanning forests
0 references
Greedy heuristics
0 references
