OPTIMAL ATTACK AND REINFORCEMENT OF A NETWORK

被引：174

作者：

CUNNINGHAM, WH

机构：

[1] Carleton Univ, Dep of Mathematics, & Statistics, Ottawa, Ont, Can, Carleton Univ, Dep of Mathematics & Statistics, Ottawa, Ont, Can

来源：

JOURNAL OF THE ACM | 1985年 / 32卷 / 03期

关键词：

GREEDY ALGORITHM - NETWORKS - OPTIMAL ATTACK AND REINFORCEMENT - POLYMATROIDS - STRONGLY POLYNOMIAL ALGORITHMS;

D O I：

10.1145/3828.3829

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：549 / 561

页数：13

共 19 条

[1]

Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6

[2] TESTING MEMBERSHIP IN MATROID POLYHEDRA [J].

CUNNINGHAM, WH .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 36 (02) :161-188

[3] MINIMUM CUTS, MODULAR-FUNCTIONS, AND MATROID POLYHEDRA [J].

CUNNINGHAM, WH .

NETWORKS, 1985, 15 (02) :205-215

[4]

Dinkelbach W., 1967, MANAGE SCI, V13, P492, DOI DOI 10.1287/MNSC.13.7.492

[5] MINIMUM PARTITION OF A MATROID INTO INDEPENDENT SUBSETS [J].

EDMONDS, J .

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

[6]

Edmonds J., 1970, COMBINATORIAL STRUCT, P69

[7] LEXICOGRAPHICALLY OPTIMAL BASE OF A POLYMATROID WITH RESPECT TO A WEIGHT VECTOR [J].

FUJISHIGE, S .

MATHEMATICS OF OPERATIONS RESEARCH, 1980, 5 (02) :186-196

[8]

Gondran M., 1984, GRAPHS ALGORITHMS

[9] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].

GROTSCHEL, M ;

LOVASZ, L ;

SCHRIJVER, A .

COMBINATORICA, 1981, 1 (02) :169-197

[10] CONNECTIVITY AND EDGE-DISJOINT SPANNING-TREES [J].

GUSFIELD, D .

INFORMATION PROCESSING LETTERS, 1983, 16 (02) :87-89

← 1 2 →