THE PARALLEL COMPLEXITY OF TSP HEURISTICS

被引：9

作者：

KINDERVATER, GAP

LENSTRA, JK

SHMOYS, DB

机构：

[1] CTR MATH & COMP SCI,AMSTERDAM,NETHERLANDS

[2] ERASMUS UNIV,3000 DR ROTTERDAM,NETHERLANDS

[3] MIT,CAMBRIDGE,MA 02139

来源：

JOURNAL OF ALGORITHMS | 1989年 / 10卷 / 02期

关键词：

D O I：

10.1016/0196-6774(89)90015-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：249 / 270

页数：22

共 19 条

[1] EFFICIENT PARALLEL ALGORITHMS FOR SOME GRAPH PROBLEMS [J].

CHIN, FY ;

LAM, J ;

CHEN, IN .

COMMUNICATIONS OF THE ACM, 1982, 25 (09) :659-665

[2]

Cook S.A., 1981, ENSEIGNEMENT MATH, VXXVII, P99

[3] OBSERVATION ON TIME-STORAGE TRADE OFF [J].

COOK, SA .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) :308-316

[4]

COPPERSMITH D, 19TH P ANN ACM S THE, P1

[5]

DEKEL E, 1983, IEEE T COMPUT, V32, P307, DOI 10.1109/TC.1983.1676223

[6]

FORTUNE S, 10TH P ANN ACM S THE, P114

[7]

Garey MR., 1979, COMPUTERS INTRACTABI

[8] THE MAXIMUM FLOW PROBLEM IS LOG SPACE COMPLETE FOR P [J].

GOLDSCHLAGER, LM ;

SHAW, RA ;

STAPLES, J .

THEORETICAL COMPUTER SCIENCE, 1982, 21 (01) :105-111

[9] THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE [J].

JOHNSON, DS .

JOURNAL OF ALGORITHMS, 1983, 4 (02) :189-203

[10] CONSTRUCTING A PERFECT MATCHING IS IN RANDOM NC [J].

KARP, RM ;

UPFAL, E ;

WIGDERSON, A .

COMBINATORICA, 1986, 6 (01) :35-48

← 1 2 →