A 32 approximation for a constrained forest problem

DOI10.1007/978-3-642-23719-5_55MaRDI QIDQ3092268zbMATH OpenOpenAlexFDO

Authors Basile Couëtoux

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_55

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Another greedy heuristic for the constrained forest problem
• A class of heuristics for the constrained forest problem
• Complexity and approximation of the constrained forest problem
• A 3/2-approximation algorithm for some minimum-cost graph problems
• scientific article; zbMATH DE number 742977

Cited in

(6)

• Around the Danzer problem and the construction of dense forests
• A 3/2-approximation algorithm for some minimum-cost graph problems
• A class of heuristics for the constrained forest problem
• scientific article; zbMATH DE number 742977 (Why is no real title available?)
• Complexity and approximation of the constrained forest problem
• Another greedy heuristic for the constrained forest problem

This page was built for publication: A \(\frac{3}{2}\) approximation for a constrained forest problem

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