Ahmadi A, Gholami I, Hajiaghayi M, Jabbarzade P and Mahdavi M. Prize-Collecting Steiner Tree: A 1.79 Approximation. Proceedings of the 56th Annual ACM Symposium on Theory of Computing. (1641-1652).

Hauptmann M. (2013). On the approximability of Dense Steiner Problems. Journal of Discrete Algorithms. 21. (41-51). Online publication date: 1-Jul-2013.

https://doi.org/10.1016/j.jda.2013.06.005

Nguyen V. (2013). A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP. Journal of Combinatorial Optimization. 25:2. (265-278). Online publication date: 1-Feb-2013.

https://doi.org/10.1007/s10878-012-9501-z

Hajiaghayi M, Khandekar R, Kortsarz G and Nutov Z. (2012). Prize-collecting steiner network problems. ACM Transactions on Algorithms. 9:1. (1-13). Online publication date: 1-Dec-2012.

https://doi.org/10.1145/2390176.2390178

Bateni M, Hajiaghayi M and Marx D. (2011). Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth. Journal of the ACM. 58:5. (1-37). Online publication date: 1-Oct-2011.

https://doi.org/10.1145/2027216.2027219

Krishnaswamy R, Kumar A, Nagarajan V, Sabharwal Y and Saha B. The matroid median problem. Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms. (1117-1130).

/doi/10.5555/2133036.2133120

Bateni M, Chekuri C, Ene A, Hajiaghayi M, Korula N and Marx D. Prize-collecting Steiner problems on planar graphs. Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms. (1028-1049).

/doi/10.5555/2133036.2133115

Nguyen V. A primal-dual approximation algorithm for the asymmetric prize-collecting TSP. Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I. (260-269).

/doi/10.5555/1940390.1940412

Kamiyama N. The prize-collecting edge dominating set problem in trees. Proceedings of the 35th international conference on Mathematical foundations of computer science. (465-476).

/doi/10.5555/1885577.1885618

Hajiaghayi M, Khandekar R, Kortsarz G and Nutov Z. Prize-Collecting steiner network problems. Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization. (71-84).

https://doi.org/10.1007/978-3-642-13036-6_6

Byrka J, Grandoni F, Rothvoß T and Sanità L. An improved LP-based approximation for steiner tree. Proceedings of the forty-second ACM symposium on Theory of computing. (583-592).

https://doi.org/10.1145/1806689.1806769

Bateni M, Hajiaghayi M and Marx D. Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. Proceedings of the forty-second ACM symposium on Theory of computing. (211-220).

https://doi.org/10.1145/1806689.1806720

Bateni M and Hajiaghayi M. Euclidean prize-collecting steiner forest. Proceedings of the 9th Latin American conference on Theoretical Informatics. (503-514).

https://doi.org/10.1007/978-3-642-12200-2_44