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 条
  • [31] A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
    Tan, Xuehou
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (01) : 92 - 103
  • [32] A 21/2-approximation algorithm for shortest superstring
    Sweedyk, Z
    SIAM JOURNAL ON COMPUTING, 2000, 29 (03) : 954 - 986
  • [33] A New 2-Approximation Algorithm for rSPR Distance
    Chen, Zhi-Zhong
    Harada, Youta
    Wang, Lusheng
    BIOINFORMATICS RESEARCH AND APPLICATIONS (ISBRA 2017), 2017, 10330 : 128 - 139
  • [34] An Iterative Rounding 2-approximation Algorithm for the k-partial Vertex Cover Problem
    Jian-hua TU
    Jun-feng DU
    Feng-mei YANG
    Acta Mathematicae Applicatae Sinica(English Series), 2014, 30 (02) : 271 - 278
  • [35] 3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
    Rathinam, Sivakumar
    Sengupta, Raja
    OPERATIONS RESEARCH LETTERS, 2010, 38 (01) : 63 - 68
  • [36] An Iterative Rounding 2-approximation Algorithm for the k-partial Vertex Cover Problem
    Jian-hua TU
    Jun-feng DU
    Feng-mei YANG
    Acta Mathematicae Applicatae Sinica, 2014, (02) : 271 - 278
  • [37] A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
    Nagamochi, H
    Okada, K
    DISCRETE APPLIED MATHEMATICS, 2004, 140 (1-3) : 103 - 114
  • [38] 2-approximation and hybrid genetic algorithm for long chain design problem in process flexibility
    Zhang, Yuli
    Song, Shiji
    Wu, Cheng
    Communications in Computer and Information Science, 2013, 355 : 230 - 240
  • [39] A 2-approximation algorithm for the vertex cover P4 problem in cubic graphs
    Li, Yuchao
    Tu, Jianhua
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2014, 91 (10) : 2103 - 2108
  • [40] An Iterative Rounding 2-approximation Algorithm for the k-partial Vertex Cover Problem
    Tu, Jian-hua
    Du, Jun-feng
    Yang, Feng-mei
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2014, 30 (02): : 271 - 278
12345