15 citations
- Bellevue Hospital CenterUS1 paper
- Dalian UniversityCN1 paper
- Dalian University of TechnologyCN1 paper
- Harbin Institute of TechnologyCN1 paper
- Lanzhou UniversityCN1 paper
- Microsoft (United States)US1 paper
- Quanzhou Normal UniversityCN1 paper
- Shandong UniversityCN1 paper
- Sun Yat-sen UniversityCN1 paper
- The University of AdelaideAU1 paper
- Xidian UniversityCN1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
A Dynamic Programming Solution to a Generalized LCS Problem
Lei Wang, Xiaodong Wang, Yingjie Wu +1
In this paper, we consider a generalized longest common subsequence problem, the string-excluding constrained LCS problem. For the two input sequences and of lengths an…
cs.DS2013★ 3 cited
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
Longkun Guo, Hong Shen, Kewen Liao
For a given graph with positive integral cost and delay on edges, distinct vertices and , cost bound and delay bound , the bi-constraint pat…