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

Samuel R. Buss and Peter N. Yianilos
SIAM J. Computing 27(1):170–201, Feb 1998
Proc. 5th Symp. Discrete Algorithms, ACM and SIAM, Jan 1994, pp. 65–76
ftp://euclid.ucsd.edu/pub/sbuss/research/quasiconvex.ps

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!