Connectivity augmentation of networks: structures and algorithms

被引：0

作者：

András Frank

机构：

[1] Eötvös University,Department of Operations Research

[2] Ericsson Traffic Laboratory,undefined

来源：

Mathematical Programming | 1999年 / 84卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：439 / 441

页数：2

共 50 条

[1] Connectivity augmentation of networks: structures and algorithms
Frank, A
MATHEMATICAL PROGRAMMING, 1999, 84 (03) : 439 - 441
[2] Recent development of graph connectivity augmentation algorithms
Nagamochi, H
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (03): : 372 - 383
[3] Approximation algorithms for node and element connectivity augmentation problems
Nutov, Zeev
THEORY OF COMPUTING SYSTEMS, 2024, 68 (05) : 1468 - 1485
[4] Parallel and fast sequential algorithms for undirected edge connectivity augmentation
András A. Benczúr
Mathematical Programming, 1999, 84 : 595 - 640
[5] Parallel and fast sequential algorithms for undirected edge connectivity augmentation
Benczúr, AA
MATHEMATICAL PROGRAMMING, 1999, 84 (03) : 595 - 640
[6] Connectivity Augmentation in Tactical Mobile Ad hoc Networks
Reidt, Steffen
Wolthusen, Stephen D.
2008 IEEE MILITARY COMMUNICATIONS CONFERENCE: MILCOM 2008, VOLS 1-7, 2008, : 1112 - 1118
[7] A Computational Investigation of Heuristic Algorithms for 2-Edge-Connectivity Augmentation
Bang-Jensen, Jorgen
Chiarandini, Marco
Morling, Peter
NETWORKS, 2010, 55 (04) : 299 - 325
[8] Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
Nutov, Zeev
COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2016, 2016, 9691 : 324 - 339
[9] Polynomial time algorithms for 2-edge-connectivity augmentation problems
Galluccio, A
Proietti, G
ALGORITHMICA, 2003, 36 (04) : 361 - 374
[10] Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems
Anna Galluccio
Guido Proietti
Algorithmica, 2003, 36 : 361 - 374

← 1 2 3 4 5 →