“…To the best of our knowledge, Max Min FVS was first considered by Mishra and Sikdar [33], who showed that the problem does not admit an n 1/2− approximation (unless P = NP), and that it remains APX-hard for ∆ ≥ 9. On the other hand, UDS and Max Min VC are well-studied problems, both in the context of approximation and in the context of parameterized complexity [1,5,9,11,13,14,19,28,30,34,36]. Many other classical optimization problems have recently been studied in the MaxMin or MinMax framework, such as Max Min Separator [25], Max Min Cut [21], Min Max Knapsack (also known as the Lazy Bureaucrat Problem) [3,23,24], and Max Min Edge Cover [32,26].…”