Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours

Authors:
Samuel R. Buss;Peter N. Yianilos
Affiliations:
Department of Mathematics, University of California, San Diego, La Jolla, CA;NEC Research Institute, 4 Independence Way, Princeton, NJ
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

Citing 13
Cited 2

Bipartite graph matching for points on a line or a circle

Journal of Algorithms
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
Geometry helps in matching

SIAM Journal on Computing
A linear-time algorithm for concave one-dimensional dynamic programming

Information Processing Letters
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
Applications of generalized matrix searching to geometric algorithms

Discrete Applied Mathematics - Computational combinatiorics
An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon

Information Processing Letters
On-line dynamic programming with applications to the prediction of RNA secondary structure

Journal of Algorithms
Fast matching algorithms for points on a polygon

SIAM Journal on Computing
Improved Selection on Totally Monotone Arrays

Proceedings of the 11th Conference on Foundations of Software Technology and Theoretical Computer Science

Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications

Proceedings of the eleventh annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry

Proceedings of the twelfth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract