The maximum f-depth Spanning tree problem

Jérôme Monnot (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

This paper deals with the problem of constructing directed trees of optimal weight and root r with depth at most f(|V|) (called f-depthDSTP_r). We first prove that the maximization and the minimization versions are equal-approximable under the differential ratio, that measures how the value of an approximate solution is placed in the interval between the worst and the best solutions values of an instance. We show that both problems can be approximately solved, in polynomial time, within differential ratio bounded above by (lim inf f-1)/lim inf f. Next, we demonstrate that, when dealing with edge distances 1and 2,undirected graphs and f(n)=2 (called 2-depthSTP_r[1,2]), we improve the ratio to 3/4. Based upon these results, we obtain new bounds for standard ratio} a (lim inf f-1)/lim inf f-standard approximation for Max f-depthDSTP_r which can be improved to 4/5 for Min 2-depthSTP_r[1,2] and 7/8 for Max 2-depthSTP_r[1,2].

Mots clés: Approximate algorithms; Differential ratio; Performance ratio; Analysis of Algorithms; Reductions

Jérôme Monnot. The maximum f-depth Spanning tree problem. Information Processing Letters, 2001, 80, pp.179-187. ⟨hal-00004001⟩