Funder
US-Israel Binational Science Foundation
National Science Foundation
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. Approximating the tree and tour covers of a graph;Arkin;Inform. Process. Lett.,1993
2. Minimum-diameter covering problems;Arkin;Networks,2000
3. Bichromatic 2-center of pairs of points;Arkin;Comput. Geom.,2015
4. Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S.B. Mitchell, Marina Simakov, Choice is hard, in: Proc. 26th Internat. Sympos. Algorithms and Computation, ISAAC 2015, 2015, pp. 318–328.
5. Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S.B. Mitchell, Marina Simakov, Conflict-free covering, in: Proc. 27th Canadian Conf. on Comput. Geom., CCCG 2015, 2015.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献