A class of heuristics for the constrained forest problem (Q2581555): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Michael J. Laszlo / rank
Normal rank
 
Property / author
 
Property / author: Michael J. Laszlo / rank
 
Normal rank
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.dam.2005.06.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997501542 / 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
Property / cites work
 
Property / cites work: Another greedy heuristic for the constrained forest problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    10 January 2006
    0 references
    0 references
    Constrained forest problem
    0 references
    Tree partitioning
    0 references
    Minimum spanning forests
    0 references
    Greedy heuristics
    0 references
    0 references