A 2-approximation algorithm for the network substitution problem

被引：0
|
作者：
Pisaruk, NN [1 ]
机构：
[1] Belarusian State Univ, Fac Appl Math & Informat, Minsk 220088, BELARUS
来源：
OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 01期
关键词：
network; scheduling; complexity; approximation algorithm;
D O I：
10.1016/j.orl.2005.03.005
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The network substitution problem is to substitute an existing network for a new network so that to minimize the cost of exploiting the existing network during the period when the new network is being constructed. We show that this problem is NP-hard, and propose a 2-approximation algorithm for solving it. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：94 / 96
页数：3
相关论文
共 50 条
  • [21] 1/2-Approximation Polynomial-Time Algorithm for a Problem of Searching a Subset
    Ageev, Alexander
    Kel'manov, Alexander
    Pyatkin, Artem
    Khamidullin, Sergey
    Shenmaier, Vladimir
    2017 INTERNATIONAL MULTI-CONFERENCE ON ENGINEERING, COMPUTER AND INFORMATION SCIENCES (SIBIRCON), 2017, : 8 - 12
  • [22] A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
    van Bevern, Rene
    Slugina, Viktoriia A.
    HISTORIA MATHEMATICA, 2020, 53 : 118 - 127
  • [23] A 2-approximation algorithm for the contig-based genomic scaffold filling problem
    Haitao Jiang
    Letu Qingge
    Daming Zhu
    Binhai Zhu
    JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2018, 16 (06)
  • [24] A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
    Xu, Zhou
    Rodrigues, Brian
    ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 127 - +
  • [25] A 2-approximation for the maximum satisfying bisection problem
    Ries, Bernard
    Zenklusen, Rico
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (02) : 169 - 175
  • [26] A 2-approximation algorithm for sorting by prefix reversals
    Fischer, J
    Ginzinger, SW
    ALGORITHMS - ESA 2005, 2005, 3669 : 415 - 425
  • [27] An Exponential Time 2-Approximation Algorithm for Bandwidth
    Fuerer, Martin
    Gaspers, Serge
    Kasiviswanathan, Shiva Prasad
    PARAMETERIZED AND EXACT COMPUTATION, 2009, 5917 : 173 - +
  • [28] Revisiting Garg's 2-Approximation Algorithm for the k-MST Problem in Graphs
    Breen, Emmett
    Mirka, Renee
    Wang, Zichen
    Williamson, David P.
    2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 56 - 68
  • [29] A 2-Approximation for the Minimum Duplication Speciation Problem
    Ouangraoua, Aida
    Swenson, Krister M.
    Chauve, Cedric
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (09) : 1041 - 1053
  • [30] An exponential time 2-approximation algorithm for bandwidth
    Fuerer, Martin
    Gaspers, Serge
    Kasiviswanathan, Shiva Prasad
    THEORETICAL COMPUTER SCIENCE, 2013, 511 : 23 - 31
12345