Reload cost problems: minimum diameter spanning tree

被引：28
|
作者：
Wirth, HC
Steffan, J
机构：
[1] Univ Wurzburg, Dept Comp Sci, D-97074 Wurzburg, Germany
[2] TH Darmstadt, IT Transfer Off, D-64283 Darmstadt, Germany
来源：
DISCRETE APPLIED MATHEMATICS | 2001年 / 113卷 / 01期
关键词：
transportation problems; network design; diameter; spanning tree; node weighted graphs;
D O I：
10.1016/S0166-218X(00)00392-9
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of different colors. We consider the problem of finding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On the other hand we provide an exact algorithm for graphs of maximum degree 3. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：73 / 85
页数：13
相关论文
共 50 条
  • [1] Parameterized complexity of finding a spanning tree with minimum reload cost diameter
    Baste, Julien
    Gozupek, Didem
    Paul, Christophe
    Sau, Ignasi
    Shalom, Mordechai
    Thilikos, Dimitrios M.
    [J]. NETWORKS, 2020, 75 (03) : 259 - 277
  • [2] Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
    Seo, Dae Young
    Lee, D. T.
    Lin, Tien-Ching
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 283 - +
  • [3] Minimum cost spanning tree problems with groups
    Bergantinos, Gustavo
    Gomez-Rua, Maria
    [J]. ECONOMIC THEORY, 2010, 43 (02) : 227 - 262
  • [4] Minimum cost spanning tree problems with groups
    Gustavo Bergantiños
    María Gómez-Rúa
    [J]. Economic Theory, 2010, 43 : 227 - 262
  • [5] Additivity in minimum cost spanning tree problems
    Bergantinos, Gustavo
    Vidal-Puga, Juan
    [J]. JOURNAL OF MATHEMATICAL ECONOMICS, 2009, 45 (1-2) : 38 - 42
  • [6] Minimum cost spanning tree problems as value sharing problems
    Trudeau, Christian
    [J]. INTERNATIONAL JOURNAL OF GAME THEORY, 2023, 52 (01) : 253 - 272
  • [7] Minimum cost spanning tree problems as value sharing problems
    Christian Trudeau
    [J]. International Journal of Game Theory, 2023, 52 : 253 - 272
  • [8] The complexity of a minimum reload cost diameter problem
    Galbiati, Giulia
    [J]. DISCRETE APPLIED MATHEMATICS, 2008, 156 (18) : 3494 - 3497
  • [9] An egalitarian solution to minimum cost spanning tree problems
    Emre Doğan
    İbrahim Barış Esmerok
    [J]. International Journal of Game Theory, 2024, 53 : 127 - 141
  • [10] An egalitarian solution to minimum cost spanning tree problems
    Dogan, Emre
    Esmerok, Ibrahim Baris
    [J]. INTERNATIONAL JOURNAL OF GAME THEORY, 2024, 53 (01) : 127 - 141
12345