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 条
  • [1] On k-Path Covers and their applications
    Stefan Funke
    André Nusser
    Sabine Storandt
    The VLDB Journal, 2016, 25 : 103 - 123
  • [2] On k-Path Covers and their Applications
    Funke, Stefan
    Nusser, Andre
    Storandt, Sabine
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2014, 7 (10): : 893 - 902
  • [3] On k-Path Covers and their applications
    Funke, Stefan
    Nusser, Andre
    Storandt, Sabine
    VLDB JOURNAL, 2016, 25 (01): : 103 - 123
  • [4] Path generation issues for survivable network design
    Pioro, Michal
    Sliwinski, Tomasz
    Zagozdzon, Michal
    Dzida, Mateusz
    Ogryczak, Wlodzimierz
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2008, PT 2, PROCEEDINGS, 2008, 5073 : 820 - 835
  • [5] Social network analysis using k-Path centrality method
    Taniarza, Natya
    Adiwijaya
    Maharani, Warih
    INTERNATIONAL CONFERENCE ON DATA AND INFORMATION SCIENCE (ICODIS), 2018, 971
  • [6] The Matrix Diagonal Dominance with k-path Covering and its Application
    Lv, Hongbin
    PROCEEDINGS OF THE THIRD INTERNATIONAL WORKSHOP ON MATRIX ANALYSIS AND APPLICATIONS, VOL 2, 2009, : 157 - 160
  • [7] Path generation for a class of survivable network design problems
    Dzida, Mateusz
    Zagozdzon, Michal
    Pioro, Michal
    Sliwinski, Tomasz
    Ogryczak, Wlodzimierz
    2008 NEXT GENERATION INTERNET NETWORKS AND 4TH EURONGI CONFERENCE ON NEXT GENERATION INTERNET NETWORKS, PROCEEDINGS, 2008, : 31 - +
  • [8] Survivable Hierarchical Optical Path Network Design With Dedicated Wavelength Path Protection
    Yamada, Yoshiyuki
    Hasegawa, Hiroshi
    Sato, Ken-Ichi
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2011, 29 (21) : 3196 - 3209
  • [9] A Novel K-path based Resource Allocation Scheme for Optical Network on Chip
    Li, Wenzhe
    Guo, Bingli
    Li, Xin
    Yin, Shan
    Zhou, Yu
    Zhang, Jie
    Huang, Shanguo
    2016 ASIA COMMUNICATIONS AND PHOTONICS CONFERENCE (ACP), 2016,
  • [10] A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
    Lina Chen
    Xiaohui Huang
    Zhao Zhang
    Journal of Combinatorial Optimization, 2018, 36 : 35 - 43
12345