Another greedy heuristic for the constrained forest problem (Q813973): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.orl.2004.11.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2074402410 / rank | |||
Normal rank | |||
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 |
Latest revision as of 10:52, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Another greedy heuristic for the constrained forest problem |
scientific article |
Statements
Another greedy heuristic for the constrained forest problem (English)
0 references
2 February 2006
0 references
constrained forest problem
0 references
tree partitioning
0 references
minimum spanning forests
0 references
greedy heuristics
0 references