Elie Nakache

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we study the approximability of the Maximum Labeled Path problem: given a vertex-labeled directed acyclic graph D, find a path in D that collects a maximum number of distinct labels. For any $$\epsilon >0$$ ϵ > 0 , we provide a polynomial time approximation algorithm that computes a solution of value at least $$OPT^{1-\epsilon }$$ O P T 1 - ϵ(More)
  • 1