Another greedy heuristic for the constrained forest problem

DOI10.1016/J.ORL.2004.11.010zbMath1141.90566OpenAlexW2074402410MaRDI QIDQ813973

Sumitra Mukherjee, Michael J. Laszlo

Publication date: 2 February 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.11.010

zbMATH Keywords

minimum spanning foreststree partitioninggreedy heuristicsconstrained forest problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (4)

An approximation algorithm for network design problems with downwards-monotone demand functions ⋮ Complexity and approximation of the constrained forest problem ⋮ A 3/2-approximation algorithm for some minimum-cost graph problems ⋮ A class of heuristics for the constrained forest problem

Cites Work

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

This page was built for publication: Another greedy heuristic for the constrained forest problem