Author:
Adjiashvili David,Hommelsheim Felix,Mühlenthaler Moritz
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference22 articles.
1. Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Trans. Algorithms (TALG) 15(2), 19 (2018)
2. Adjiashvili, D., Bosio, S., Weismantel, R., Zenklusen, R.: Time-expanded packings. In: International Colloquium on Automata. Languages, and Programming, pp. 64–76. Springer, Berlin (2014)
3. Adjiashvili, D., Hommelsheim, F., Mühlenthaler, M.: Flexible graph connectivity. arXiv:1910.13297 (2019)
4. Adjiashvili, D., Hommelsheim, F., Mühlenthaler, M.: Flexible graph connectivity. In International Conference on Integer Programming and Combinatorial Optimization, pp. 13–26 (2020)
5. Adjiashvili, D., Stiller, S., Zenklusen, R.: Bulk-robust combinatorial optimization. Math. Program. 149(1–2), 361–390 (2015). https://doi.org/10.1007/s10107-014-0760-6
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献