Prize collecting Steiner trees with node degree dependent costs

被引：6
|
作者：
Gouveia, Luis [1 ]
Moura, Pedro [1 ]
de Sousa, Amaro [2 ]
机构：
[1] Univ Lisbon, Fac Ciencias, CIO DEIO, P-1749016 Lisbon, Portugal
[2] Univ Aveiro, Inst Telecomunicacoes, P-3810193 Aveiro, Portugal
来源：
COMPUTERS & OPERATIONS RESEARCH | 2011年 / 38卷 / 01期
关键词：
Steiner trees; Degree constraints; Reformulation; Valid inequalities;
D O I：
10.1016/j.cor.2010.04.016
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We discuss a variant of the prize-collecting Steiner tree problem with node degree dependent costs using a telecommunications setting to motivate these costs. We present and test models which are tailored for this variant of the problem. Results taken from instances with up to 100 nodes are used to evaluate the quality of the proposed models for solving the problem, as well as, in terms of the correspondent linear programming relaxation. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码：234 / 245
页数：12
相关论文
共 50 条
  • [1] The fractional prize-collecting Steiner tree problem on trees
    Klau, GW
    Ljubic, I
    Mutzel, P
    Pferschy, U
    Weiskircher, R
    ALGORITHMS - ESA 2003, PROCEEDINGS, 2003, 2832 : 691 - 702
  • [2] An Approximation Algorithm for Constructing Multicast Trees with Degree-Dependent Node Costs
    Lin, Hwa-Chun
    Yang, Hsiu-Ming
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [3] An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
    Markarian, Christine
    COMBINATORIAL ALGORITHMS, IWOCA 2018, 2018, 10979 : 214 - 223
  • [4] Euclidean Prize-Collecting Steiner Forest
    MohammadHossein Bateni
    MohammadTaghi Hajiaghayi
    Algorithmica, 2012, 62 : 906 - 929
  • [5] Euclidean Prize-Collecting Steiner Forest
    Bateni, MohammadHossein
    Hajiaghayi, MohammadTaghi
    ALGORITHMICA, 2012, 62 (3-4) : 906 - 929
  • [6] Euclidean Prize-Collecting Steiner Forest
    Bateni, MohammadHossein
    Hajiaghayi, MohammadTaghi
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 503 - 514
  • [7] Prize-Collecting Steiner Network Problems
    Hajiaghayi, MohammadTaghi
    Khandekar, Rohit
    Kortsarz, Guy
    Nutov, Zeev
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2010, 6080 : 71 - 84
  • [8] Prize-Collecting Steiner Network Problems
    Hajiaghayi, Mohammadtaghi
    Khandekar, Rohit
    Kortsarz, Guy
    Nutov, Zeev
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 9 (01)
  • [9] Robust disease module mining via enumeration of diverse prize-collecting Steiner trees
    Bernett, Judith
    Krupke, Dominik
    Sadegh, Sepideh
    Baumbach, Jan
    Fekete, Sandor P.
    Kacprowski, Tim
    List, Markus
    Blumenthal, David B.
    BIOINFORMATICS, 2022, 38 (06) : 1600 - 1606
  • [10] An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
    Koenemann, Jochen
    Sadeghian, Sina
    Sanita, Laura
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 568 - 577
12345