Corrigendum to: ``Approximation hardness of min-max tree covers

DOI10.1016/j.orl.2013.07.002zbMath1286.90133OpenAlexW1978044180MaRDI QIDQ2450715

Qi Wen, Zhou Xu

Publication date: 15 May 2014

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Corrigendum to: ``Approximation hardness of min-max tree covers