ON THE RELATIONSHIP BETWEEN THE BICONNECTIVITY AUGMENTATION AND TRAVELING SALESMAN PROBLEMS

被引：55

作者：

FREDERICKSON, GN

JAJA, J

机构：

来源：

THEORETICAL COMPUTER SCIENCE | 1982年 / 19卷 / 02期

关键词：

D O I：

10.1016/0304-3975(82)90059-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：189 / 201

页数：13

共 22 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2] EVERY PLANAR MAP IS 4 COLORABLE .1. DISCHARGING [J].

APPEL, K ;

HAKEN, W .

ILLINOIS JOURNAL OF MATHEMATICS, 1977, 21 (03) :429-490

[3] EVERY PLANAR MAP IS 4 COLORABLE .2. REDUCIBILITY [J].

APPEL, K ;

HAKEN, W ;

KOCH, J .

ILLINOIS JOURNAL OF MATHEMATICS, 1977, 21 (03) :491-567

[4] DYNAMIC PROGRAMMING TREATMENT OF TRAVELLING SALESMAN PROBLEM [J].

BELLMAN, R .

JOURNAL OF THE ACM, 1962, 9 (01) :61-&

[5]

Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[6]

CHRISTOFIDES N, 1976, 388 CARN MELL U MAN

[7] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+

[8]

Eswaran K. P., 1976, SIAM Journal on Computing, V5, P653, DOI 10.1137/0205044

[9] APPROXIMATION ALGORITHMS FOR SEVERAL GRAPH AUGMENTATION PROBLEMS [J].

FREDERICKSON, GN ;

JAJA, J .

SIAM JOURNAL ON COMPUTING, 1981, 10 (02) :270-283

[10]

GABOW H, 1975, CUCS07575 U COL DEP

← 1 2 3 →