A class of heuristics for the constrained forest problem

DOI10.1016/j.dam.2005.06.006zbMath1110.68107OpenAlexW1997501542MaRDI QIDQ2581555

Sumitra Mukherjee, Michael J. Laszlo

Publication date: 10 January 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.06.006

zbMATH Keywords

Greedy heuristicsTree partitioningConstrained forest problemMinimum spanning forests

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Complexity and approximation of the constrained forest problem ⋮ A 3/2-approximation algorithm for some minimum-cost graph problems

Cites Work

• Another greedy heuristic for the constrained forest problem
• A greedy heuristic for a minimum-weight forest problem
• On the complexity of graph tree partition problems.
• Unnamed Item

This page was built for publication: A class of heuristics for the constrained forest problem