The Maximum Labeled Path Problem

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 ϵ > 0 , we provide a polynomial time approximation algorithm that computes a solution of v...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2017-05, Vol.78 (1), p.298-318
Hauptverfasser:	Couëtoux, Basile, Nakache, Elie, Vaxès, Yann
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Job shops Mathematical analysis Mathematics of Computing Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!