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 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.

[1]  Francesco Mason,et al.  Path Covering Problems and Testing of Printed Circuits , 1995, Discret. Appl. Math..

[2]  Robert L. Mercer,et al.  The Mathematics of Statistical Machine Translation: Parameter Estimation , 1993, CL.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[5]  Joseph JáJá,et al.  Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..

[6]  Daniel Marcu,et al.  A Phrase-Based,Joint Probability Model for Statistical Machine Translation , 2002, EMNLP.

[7]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[8]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[9]  Kevin Knight,et al.  A Syntax-based Statistical Translation Model , 2001, ACL.

[10]  Jon Feldman,et al.  A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set , 2001, RANDOM-APPROX.

[11]  Hermann Ney,et al.  Improved Alignment Models for Statistical Machine Translation , 1999, EMNLP.

[12]  Hiroshi Nagamochi,et al.  An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree , 1999, Discret. Appl. Math..

[13]  Dekang Lin A Path-based Transfer Model for Machine Translation , 2004, COLING.

[14]  Samir Khuller,et al.  Biconnectivity approximations and graph carvings , 1992, STOC '92.

[15]  S. Louis Hakimi,et al.  On Path Cover Problems in Digraphs and Applications to Program Testing , 1979, IEEE Transactions on Software Engineering.

[16]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[17]  Robert E. Bixby,et al.  An Almost Linear-Time Algorithm for Graph Realization , 1988, Math. Oper. Res..