Funder
israel science foundation
united states - israel binational science foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference24 articles.
1. Agarwal P, Eppstein D, Guibas L, Henzinger M (1998) Parametric and kinetic minimum spanning trees. In: 39th annual symposium on foundations of computer science, 1998. Proceedings. IEEE, pp 596–605
2. Arai T, Ueno S, Kajitani Y (1993) Generalization of a theorem on the parametric maximum flow problem. Discret Appl Math 41(1):69–74
3. Bazgan C, Herzel A, Ruzika S, Thielen C, Vanderpooten D (2020) An approximation algorithm for a general class of parametric optimization problems. J Combin Optim. https://doi.org/10.1007/s10878-020-00646-5
4. Carstensen PJ (1983a) The complexity of some problems in parametric, linear, and combinatorial programming. Ph.d. thesis, University of Michigan
5. Carstensen PJ (1983) Complexity of some parametric integer and network programming problems. Math Program 26(1):64–75