An Approximation Algorithm for the Generalized Prize-Collecting Steiner Forest Problem with Submodular Penalties

Journal of the Operations Research Society of China ◽

10.1007/s40305-021-00355-8 ◽

2021 ◽

Author(s):

Xiao-Dan Jia ◽

Bo Hou ◽

Wen Liu

Keyword(s):

Approximation Algorithm ◽

Steiner Forest ◽

Prize Collecting

Download Full-text

An approximation algorithm for the k-generalized Steiner forest problem

Optimization Letters ◽

10.1007/s11590-021-01727-y ◽

2021 ◽

Author(s):

Jiawen Gao ◽

Suogang Gao ◽

Wen Liu ◽

Weili Wu ◽

Ding-Zhu Du ◽

...

Keyword(s):

Approximation Algorithm ◽

Download Full-text

A Primal-Dual Algorithm for the Generalized Prize-Collecting Steiner Forest Problem

Journal of the Operations Research Society of China ◽

10.1007/s40305-017-0164-4 ◽

2017 ◽

Vol 5 (2) ◽

pp. 219-231

Author(s):

Lu Han ◽

Da-Chuan Xu ◽

Dong-Lei Du ◽

Chen-Chen Wu

Keyword(s):

Dual Algorithm ◽

Steiner Forest ◽

Primal Dual ◽

Prize Collecting

Download Full-text

An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-94667-2_18 ◽

2018 ◽

pp. 214-223

Author(s):

Christine Markarian

Keyword(s):

Optimal Algorithm ◽

Steiner Forest ◽

Prize Collecting

Download Full-text

A 4-approximation algorithm for k-prize collecting Steiner tree problems

Optimization Letters ◽

10.1007/s11590-018-1367-2 ◽

2018 ◽

Vol 13 (2) ◽

pp. 341-348 ◽

Author(s):

Yusa Matsuda ◽

Satoshi Takahashi

Keyword(s):

Approximation Algorithm ◽

Steiner Tree ◽

Steiner Tree Problems ◽

Prize Collecting

Download Full-text

A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP

Combinatorial Optimization and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-17458-2_22 ◽

2010 ◽

pp. 260-269 ◽

Author(s):

Viet Hung Nguyen

Keyword(s):

Approximation Algorithm ◽

Primal Dual ◽

Prize Collecting

Download Full-text

An approximation algorithm to the k-Steiner Forest problem

Theoretical Computer Science ◽

10.1016/j.tcs.2008.10.033 ◽

2009 ◽

Vol 410 (11) ◽

pp. 1093-1098 ◽

Author(s):

Peng Zhang ◽

Mingji Xia

Keyword(s):

Approximation Algorithm ◽

Download Full-text

An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.67 ◽

2013 ◽

Author(s):

Jochen Konemann ◽

Sina Sadeghian ◽

Laura Sanita

Keyword(s):

Approximation Algorithm ◽

Steiner Tree ◽

Prize Collecting

Download Full-text

An Approximation Algorithm to the k-Steiner Forest Problem

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/978-3-540-72504-6_66 ◽

2007 ◽

pp. 728-737 ◽

Author(s):

Peng Zhang

Keyword(s):

Approximation Algorithm ◽

Download Full-text

A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem

Optimization Letters ◽

10.1007/s11590-021-01831-z ◽

2021 ◽

Author(s):

Xiaofei Liu ◽

Weidong Li ◽

Runtao Xie

Keyword(s):

Approximation Algorithm ◽

Minimum Power ◽

Primal Dual ◽

Prize Collecting ◽

Download Full-text

Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-030-27195-4_24 ◽

2019 ◽

pp. 261-271

Author(s):

Jian Sun ◽

Haiyun Sheng ◽

Yuefang Sun ◽

Xiaoyan Zhang

Keyword(s):

Approximation Algorithm ◽

Steiner Tree ◽

Steiner Tree Problem ◽

Prize Collecting

Download Full-text