Online k-color spanning disk problems-Reference-Cited by-同舟云学术

Online k-color spanning disk problems

Published:2023-09 Issue:2 Volume:46 Page:
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Wang Yin,Xu Yinfeng,Zhang Huili,Tong Weitian

Funder

National Natural Science Foundation of China

the Office of Research, Georgia Southern University

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-023-01080-z.pdf

Reference14 articles.

1. Abellanas M, Hurtado F, Icking C, Klein R, Langetepe E, Ma Lihong, Palop B, Sacristán V (2001) Smallest color-spanning objects. In: European symposium on algorithms, pages 278–289

2. Bereg Sergey, Ma Feifei, Wang Wencheng, Zhang Jian, Zhu Binhai (2019) On some matching problems under the color-spanning model. Theoret Comput Sci 786:26–31

3. Das Sandip, Goswami Partha P, Nandy Subhas C (2009) Smallest color-spanning object revisited. Int J Comput Geometry Appl 19(05):457–478

4. Fleischer R, Xu X (2010) Computing minimum diameter color-spanning sets. In: international workshop on frontiers in algorithmics, pages 285–292

5. Fleischer Rudolf, Xiaoming Xu (2011) Computing minimum diameter color-spanning sets is hard. Inf Process Lett 111(21–22):1054–1056

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The 2-Mixed-Center Color Spanning Problem;Combinatorial Optimization and Applications;2023-12-09