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

Authors:
Guohui Lin;Zhipeng Cai;Dekang Lin
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta T6G 2E8, Canada
Venue:
Information Processing Letters
Year:
2006

Citing 12
Cited 0

An almost linear-time algorithm for graph realization

Mathematics of Operations Research
Biconnectivity approximations and graph carvings

Journal of the ACM (JACM)
Path covering problems and testing of printed circuits

Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
The mathematics of statistical machine translation: parameter estimation

Computational Linguistics - Special issue on using large corpora: II
A syntax-based statistical translation model

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A phrase-based, joint probability model for statistical machine translation

EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
A path-based transfer model for machine translation

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
On Path Cover Problems in Digraphs and Applications to Program Testing

IEEE Transactions on Software Engineering
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.