Selecting and covering colored points-Reference-Cited by-同舟云学术

Selecting and covering colored points

Published:2018-12 Issue: Volume:250 Page:75-86
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Arkin Esther M.,Banik Aritra^ORCID,Carmi Paz,Citovsky Gui,Katz Matthew J.,Mitchell Joseph S.B.,Simakov Marina

Funder

US-Israel Binational Science Foundation

National Science Foundation

Publisher

Elsevier BV

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 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact and heuristic methods for a workload allocation problem with chain precedence constraints;European Journal of Operational Research;2023-08

2. Fréchet Distance for Uncertain Curves;ACM Transactions on Algorithms;2023-07-14

3. Improved and Generalized Algorithms for Burning a Planar Point Set;WALCOM: Algorithms and Computation;2023

4. On Covering Segments with Unit Intervals;SIAM Journal on Discrete Mathematics;2022-05-23

5. On Covering Segments with Unit Intervals;LEIBNIZ INT PR INFOR;2020