A UNIFIED APPROACH TO APPROXIMATION ALGORITHMS FOR BOTTLENECK PROBLEMS

被引：210

作者：

HOCHBAUM, DS

SHMOYS, DB

机构：

[1] Univ of California, Berkeley,, Berkeley, CA, USA, Univ of California, Berkeley, Berkeley, CA, USA

来源：

关键词：

D O I：

10.1145/5925.5933

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：533 / 550

页数：18

共 16 条

[1]

AHO AV, 1974, DESIGN ANAL COMPUTER, P179

[2]

Chartrand G., 1974, Journal of Combinatorial Theory, Series B, V16, P290, DOI 10.1016/0095-8956(74)90075-6

[3]

Christofides N., 2022, OPERATIONS RES FORUM, V3, DOI [10.1007/s43069-021-00101-z, DOI 10.1007/S43069-021-00101-Z]

[4]

Fleischner H., 1974, Journal of Combinatorial Theory, Series B, V16, P29, DOI 10.1016/0095-8956(74)90091-4

FRIEZE, AM .

[6]

Garey MR., 1979, COMPUTERS INTRACTABI

[7]

GONZALEZ TF, 1982, 117 U TEX COMP SCI D

[8]

Hochbaum D. S., 1984, Annals of Operations Research, V1, P201, DOI 10.1007/BF01874389

[9]

HOCHBAUM DS, 1985, ANN DISCRETE MATH, V25, P189

[10]

HOCHBAUM DS, 1984, 16TH P ACM S THEOR C, P324