Author:
Rehfeldt Daniel,Shinano Yuji,Koch Thorsten
Publisher
Springer International Publishing
Reference53 articles.
1. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, Berlin (1972)
2. Leitner, M., Ljubic, I., Luipersbeck, M., Prossegger, M., Resch, M.: New Real-world Instances for the Steiner Tree Problem in Graphs. Technical report, ISOR, Uni Wien (2014)
3. Koch, T., Martin, A., Voß, S.: SteinLib: An updated library on Steiner tree problems in graphs. In: Du, D.Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 285–325. Kluwer, Dordrech (2001)
4. Fischetti, M., Leitner, M., Ljubić, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out Steiner trees: A node-based model for uniform edge costs. Math. Program. Comput. 9(2), 203–229 (2017)
5. Pajor, T., Uchoa, E., Werneck, R.F.: A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10(1), 69–118 (2018)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05
2. CMAP-LAP: Configurable Massively Parallel Solver for Lattice Problems;2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC);2021-12
3. Implications, Conflicts, and Reductions for Steiner Trees;Integer Programming and Combinatorial Optimization;2021