Vertex covering by paths on trees with its applications in machine translation

Given a tree and a set of paths in the tree, the problem of finding a minimum number of paths from the given path set to cover all the vertices in the tree is investigated in the paper. To distinguish from the classical path cover problem, such an optimization problem is referred to as vertex coveri...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 2006-01, Vol.97 (2), p.73-81
Hauptverfasser:	Lin, Guohui, Cai, Zhipeng, Lin, Dekang
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorial problems Combinatorics Combinatorics. Ordered structures Computer science control theory systems Designs and configurations Exact sciences and technology Graph theory Information processing Machine translation Mathematics Optimization Sciences and techniques of general use Studies Theoretical computing Vertex covering by paths
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Given a tree and a set of paths in the tree, the problem of finding a minimum number of paths from the given path set to cover all the vertices in the tree is investigated in the paper. To distinguish from the classical path cover problem, such an optimization problem is referred to as vertex covering by paths. The problem and its edge variant, edge covering by paths, find applications in machine translation. Complexity and algorithmic results are presented for the problem and its edge variant.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/j.ipl.2005.09.006