Funder
Office of Naval Research
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference37 articles.
1. Adjiashvili, D., Bosio, S., Weismantel, R., Zenklusen, R.: Time-expanded packings. In: Proceedings of the 41st International Colloquium on Automata, Languages and Programming, pp. 64–76 (2014)
2. Akrida, E.C., Czyzowicz, J., Gasieniec, L., Kuszner, L., Spirakis, P.G.: Temporal flows in temporal networks. J. Comput. Syst. Sci. 103, 46–60 (2019)
3. Anagnostopoulos, A., Grandoni, F., Leonardi, S., Wiese, A.: A mazing $$2+\epsilon $$ approximation for unsplittable flow on a path. ACM Trans. Algorithms 14(4), 1–23 (2018)
4. Aouad, A., Segev, D.: An approximate dynamic programming approach to the incremental knapsack problem (2020). Oper. Res. (forthcoming)
5. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献