The k-path tree matroid and its applications to survivable network design

被引：1

作者：

Arkin, Esther M. ^{[1
]}

Hassin, Refael ^{[2
]}

机构：

[1] SUNY Stony Brook, Dept Appl Math & Stat, Stony Brook, NY 11794 USA

[2] Tel Aviv Univ, Sch Math Sci, IL-69978 Tel Aviv, Israel

来源：

DISCRETE OPTIMIZATION | 2008年 / 5卷 / 02期

基金：

美国国家科学基金会;

关键词：

network connectivity; algorithm; matroid intersection;

D O I：

10.1016/j.disopt.2006.11.009

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs. We solve the problems for undirected and directed graphs. We then use these exact algorithms to give improved approximation algorithms for problems in which the weights satisfy the triangle inequality and the connectivity requirement is either 2 among at most five nodes and 1 for the other nodes, or it is 3 among a set of three nodes and I for all other nodes. (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：314 / 322

页数：9

共 50 条

[21] Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications
Li, Yamin
Peng, Shietung
Chu, Wanming
COMPUTER JOURNAL, 2009, 52 (02): : 268 - 275
[22] Efficient algorithms for finding a trunk on a tree network and its applications
Li, Yamin
Peng, Shietung
Chu, Watiming
EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2007, : 355 - +
[23] The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut
Mahjoub, Meriem
Diarrassouba, I.
Mahjoub, A. R.
Taktak, R.
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 112 : 690 - 705
[24] PERTURBATION MATRIX AND ITS APPLICATIONS IN NETWORK DESIGN
SOBHY, MI
DEIF, AS
INTERNATIONAL JOURNAL OF ELECTRONICS, 1976, 40 (03) : 257 - 266
[25] An O(k3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
Chuzhoy, Julia
Khanna, Sanjeev
2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 437 - 441
[26] The bio-networking architecture: A biologically inspired approach to the design of scalable, adaptive, and survivable/available network applications
Wang, M
Suda, T
2001 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS, 2001, : 43 - 53
[27] New Algorithms for Solving Minimum Path Sets of Fault Tree Analysis and Its Applications
Dai, Zhangyin
ENGINEERING SOLUTIONS FOR MANUFACTURING PROCESSES IV, PTS 1 AND 2, 2014, 889-890 : 600 - 605
[28] Path decomposition under a new cost measure with applications to optical network design
Anshelevich, E
Zhang, L
ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 28 - 39
[29] Path Decomposition under a New Cost Measure with Applications to Optical Network Design
Anshelevich, Elliot
Zhang, Lisa
ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (01)
[30] Optimal Submarine Cable Path Planning and Trunk-and-Branch Tree Network Topology Design
Wang, Zengfu
Wang, Qing
Moran, Bill
Zukerman, Moshe
IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (04) : 1562 - 1572

← 1 2 3 4 5 →