MINIMUM COST SPANNING TREE GAMES

被引：165

作者：

GRANOT, D ^{[1
]}

HUBERMAN, G ^{[1
]}

机构：

[1] UNIV CHICAGO,CHICAGO,IL 60637

来源：

关键词：

D O I：

10.1007/BF01584227

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：1 / 18

页数：18

共 10 条

[1]

[Anonymous], 1974, INT J GAME THEORY

[2] COST ALLOCATION FOR A SPANNING TREE - GAME THEORETIC APPROACH [J].

BIRD, CG .

[3]

Claus A., 1973, NETWORKS, V3, P289, DOI DOI 10.1002/NET.3230030402

[4]

GRANOT D, 1977, 77103 S FRAS U DISC

[5]

GRANOT D, 1976, UBC403 FAC COMM WORK

[6]

Kopelowitz A., 1967, 31 HEBR U JER DEP MA, V31

[7] COST ALLOCATION FOR STEINER TREES [J].

MEGIDDO, N .

[8]

Megiddo N., 1978, Mathematics of Operations Research, V3, P189, DOI 10.1287/moor.3.3.189

[9]

Shapley L.S., 1953, VALUE N PERSON GAMES, V28, P307

[10]

[No title captured]