Publication Details
Title: When is the assignment bound tight for the asymmetric traveling-salesman problem?
Author: A. Frieze, R. M. Karp, and B. Reed
Group: Algorithms
Date: June 1995
PDF: [Not available online]
Bibliographic Information:
SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93
Bibliographic Reference:
A. Frieze, R. M. Karp, and B. Reed. When is the assignment bound tight for the asymmetric traveling-salesman problem?. SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93, June 1995
Author: A. Frieze, R. M. Karp, and B. Reed
Group: Algorithms
Date: June 1995
PDF: [Not available online]
Bibliographic Information:
SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93
Bibliographic Reference:
A. Frieze, R. M. Karp, and B. Reed. When is the assignment bound tight for the asymmetric traveling-salesman problem?. SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93, June 1995