Another greedy heuristic for the constrained forest problem

DOI10.1016/J.ORL.2004.11.010MaRDI QIDQ813973zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A class of heuristics for the constrained forest problem
• A \(\frac{3}{2}\) approximation for a constrained forest problem
• A greedy heuristic for a minimum-weight forest problem
• A heuristic algorithm for the mini-max spanning forest problem
• scientific article; zbMATH DE number 1054929

Cites work

• scientific article; zbMATH DE number 2087736 (Why is no real title available?)
• A greedy heuristic for a minimum-weight forest problem
• On the complexity of graph tree partition problems.

Cited in

(8)

• A \(\frac{3}{2}\) approximation for a constrained forest problem
• Complexity and approximation of the constrained forest problem
• A greedy heuristic for a minimum-weight forest problem
• Stochastic maximum weight forest problem
• A class of heuristics for the constrained forest problem
• A 3/2-approximation algorithm for some minimum-cost graph problems
• scientific article; zbMATH DE number 742977 (Why is no real title available?)
• An approximation algorithm for network design problems with downwards-monotone demand functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813973)