2-Approximation for Prize-Collecting Steiner Forest

被引：0
|
作者：
Department of Computer Science, University of Maryland, United States [1 ]
机构：
来源：
Proc Annu ACM SIAM Symp Discrete Algorithms | / 669-693期
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
    Ljubic, I
    Weiskircher, R
    Pferschy, U
    Klau, GW
    Mutzel, P
    Fischetti, M
    MATHEMATICAL PROGRAMMING, 2006, 105 (2-3) : 427 - 449
  • [42] Local search with perturbations for the prize-collecting Steiner tree problem in graphs
    Canuto, SA
    Resende, MGC
    Ribeiro, CC
    NETWORKS, 2001, 38 (01) : 50 - 58
  • [43] A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem
    Akhmedov, Murodzhon
    Kwee, Ivo
    Montemanni, Roberto
    COMPUTERS & OPERATIONS RESEARCH, 2016, 70 : 18 - 25
  • [44] Exact approaches for solving robust prize-collecting Steiner tree problems
    Alvarez-Miranda, Eduardo
    Ljubic, Ivana
    Toth, Paolo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229 (03) : 599 - 612
  • [45] Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
    Hajiaghayi, MohammadTaghi
    Liaghat, Vahid
    Panigrahi, Debmalya
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 576 - 587
  • [46] Online Constrained Forest and Prize-Collecting Network Design
    Jiawei Qian
    Seeun William Umboh
    David P. Williamson
    Algorithmica, 2018, 80 : 3335 - 3364
  • [47] A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
    da Cunha, Alexandre Salles
    Lucena, Abilio
    Maculan, Nelson
    Resende, Mauricio G. C.
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (06) : 1198 - 1217
  • [48] Online Constrained Forest and Prize-Collecting Network Design
    Qian, Jiawei
    Umboh, Seeun William
    Williamson, David P.
    ALGORITHMICA, 2018, 80 (11) : 3335 - 3364
  • [49] An approximation algorithm for the prize-collecting connected dominating set problem
    Zhang, Yaoyao
    Zhang, Zhao
    Du, Ding-Zhu
    OPTIMIZATION LETTERS, 2024,
  • [50] Approximation algorithm for the stochastic prize-collecting set multicover problem
    Takazawa, Yotaro
    OPERATIONS RESEARCH LETTERS, 2022, 50 (02) : 224 - 228
12345