Funder
Deutsche Forschungsgemeinschaft
German-Israeli Foundation for Scientific Research and Development
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference31 articles.
1. Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)
2. Arocha, J.L., Bárány, I., Bracho, J., Fabila, R., Montejano, L.: Very colorful theorems. Discrete Comput. Geom. 42(2), 142–154 (2009)
3. Bárány, I.: A generalization of Carathéodory’s theorem. Discrete Math. 40(2–3), 141–152 (1982)
4. Bárány, I., Onn, S.: Colourful linear programming and its relatives. Math. Oper. Res. 22(3), 550–567 (1997)
5. Barman, S.: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory’s theorem. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC’15), pp. 361–369. ACM, New York (2015)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献