Shortest path in complete bipartite digraph problem and its applications

Authors:
Xin He;Zhi-Zhong Chen
Affiliations:
Department of Computer Science, State University of New York at Buffalo, Buffalo, NY;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-03, Japan
Venue:
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Year:
1997

The least weight subsequence problem

SIAM Journal on Computing
The concave least-weight subsequence problem revisited

Journal of Algorithms
Speeding up dynamic programming with application to molecular biology

Theoretical Computer Science
Constructing trees in parallel

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Sequence comparison with mixed convex and concave costs

Journal of Algorithms
An almost linear time algorithm for generalized matrix searching

SIAM Journal on Discrete Mathematics
Fast matching algorithms for points on a polygon

SIAM Journal on Computing
The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient dynamic programming using quadrangle inequalities

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Hi-index	0.00