Maji, Sukanya; Sadhu, Sanjib Discrete and mixed two-center problems for line segments. (English) Zbl 07824711 Inf. Process. Lett. 184, Article ID 106451, 11 p. (2024). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Abraham, Gyula; Dosa, Gyorgy; Hvattum, Lars Magnus; Olaj, Tomas Attila; Tuza, Zsolt The board packing problem. (English) Zbl 07709266 Eur. J. Oper. Res. 308, No. 3, 1056-1073 (2023). MSC: 90Bxx × Cite Format Result Cite Review PDF Full Text: DOI
Kang, Byeonguk; Choi, Jongmin; Ahn, Hee-Kap Intersecting disks using two congruent disks. (English) Zbl 07639691 Comput. Geom. 110, Article ID 101966, 13 p. (2023). MSC: 68Uxx 68Qxx 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI
Kovács, Kristóf; Tóth, Boglárka Optimized location of light sources to cover a rectangular region. (English) Zbl 07557122 CEJOR, Cent. Eur. J. Oper. Res. 30, No. 3, 1129-1149 (2022). MSC: 90Bxx × Cite Format Result Cite Review PDF Full Text: DOI
Gudmundsson, Joachim; van de Kerkhof, Mees; van Renssen, André; Staals, Frank; Wiratma, Lionov; Wong, Sampson Covering a set of line segments with a few squares. (English) Zbl 1535.68431 Theor. Comput. Sci. 923, 74-98 (2022). MSC: 68U05 68P05 68W40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Gudmundsson, Joachim; van de Kerkhof, Mees; van Renssen, André; Staals, Frank; Wiratma, Lionov; Wong, Sampson Covering a set of line segments with a few squares. (English) Zbl 07667137 Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 286-299 (2021). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI Link
Kang, Byeonguk; Choi, Jongmin; Ahn, Hee-Kap Intersecting disks using two congruent disks. (English) Zbl 07495037 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 400-413 (2021). MSC: 68Rxx 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI
van der Hoog, Ivor; van Kreveld, Marc; Meulemans, Wouter; Verbeek, Kevin; Wulms, Jules Topological stability of kinetic \(k\)-centers. (English) Zbl 1477.68497 Theor. Comput. Sci. 866, 145-159 (2021). MSC: 68U05 68Q25 68W40 90B85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bae, Sang Won \(L_1\) geodesic farthest neighbors in a simple polygon and related problems. (English) Zbl 1466.68069 Discrete Comput. Geom. 62, No. 4, 743-774 (2019). MSC: 68U05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
v. d. Hoog, Ivor; van Kreveld, Marc; Meulemans, Wouter; Verbeek, Kevin; Wulms, Jules Topological stability of kinetic \(k\)-centers. (English) Zbl 1434.68620 Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 43-55 (2019). MSC: 68U05 68Q25 68W40 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
He, Xiaozhou; Liu, Zhihui; Su, Bing; Xu, Yinfeng; Zheng, Feifeng; Zhu, Binhai Efficient algorithms for computing one or two discrete centers hitting a set of line segments. (English) Zbl 1423.90093 J. Comb. Optim. 37, No. 4, 1408-1423 (2019). MSC: 90B35 65D15 × Cite Format Result Cite Review PDF Full Text: DOI
Sadhu, Sanjib; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. (English) Zbl 1435.68353 Theor. Comput. Sci. 769, 63-74 (2019); corrigendum ibid. 806, 632-640 (2020). Reviewer: Kunal Dutta (Warsaw) MSC: 68U05 68W25 68W40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Sadhu, Sanjib; Roy, Sasanka; Nandy, Subhas C.; Roy, Suchismita Optimal covering and hitting of line segments by two axis-parallel squares. (English) Zbl 1434.68616 Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 457-468 (2017). MSC: 68U05 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Drezner, Zvi; Marianov, Vladimir; Wesolowsky, George O. Maximizing the minimum cover probability by emergency facilities. (English) Zbl 1357.90081 Ann. Oper. Res. 246, No. 1-2, 349-362 (2016). MSC: 90B85 90B10 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Díaz-Báñez, J. M.; Korman, M.; Pérez-Lantero, P.; Ventura, I. The 1-Center and 1-Highway problem revisited. (English) Zbl 1357.90014 Ann. Oper. Res. 246, No. 1-2, 167-179 (2016). MSC: 90B06 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
Khanteimouri, Payam; Mohades, Ali; Abam, Mohammad Ali; Kazemi, Mohammad Reza Efficiently approximating color-spanning balls. (English) Zbl 1339.68272 Theor. Comput. Sci. 634, 120-126 (2016). MSC: 68U05 68Q25 68W20 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Arkin, Esther M.; Díaz-Báñez, José Miguel; Hurtado, Ferran; Kumar, Piyush; Mitchell, Joseph S. B.; Palop, Belén; Pérez-Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo I. Bichromatic 2-center of pairs of points. (English) Zbl 1336.65015 Comput. Geom. 48, No. 2, 94-107 (2015). Reviewer: Jason Hanson (Redmond) MSC: 65D18 × Cite Format Result Cite Review PDF Full Text: DOI
Díaz-Báñez, José Miguel; Korman, Matias; Pérez-Lantero, Pablo; Ventura, Inmaculada The 1-center and 1-highway problem. (English) Zbl 1374.90284 Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 155-165 (2012). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Drezner, Zvi Continuous center problems. (English) Zbl 1387.90121 Eiselt, H. A. (ed.) et al., Foundations of location analysis. New York, NY: Springer (ISBN 978-1-4419-7571-3/hbk; 978-1-4419-7572-0/ebook). International Series in Operations Research & Management Science 155, 63-78 (2011). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
Suzuki, Atsuo; Drezner, Zvi The minimum equitable radius location problem with continuous demand. (English) Zbl 1161.90010 Eur. J. Oper. Res. 195, No. 1, 17-30 (2009). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
Miyagawa, Masashi Analysis of facility location using ordered rectilinear distance in regular point patterns. (English) Zbl 1474.90255 Forma 23, No. 2, 89-95 (2008). MSC: 90B80 × Cite Format Result Cite Review PDF
Pelegrín, Blas; Fernández, José; Tóth, Boglárka The 1-center problem in the plane with independent random weights. (English) Zbl 1278.90219 Comput. Oper. Res. 35, No. 3, 737-749 (2008). MSC: 90B85 90C26 × Cite Format Result Cite Review PDF Full Text: DOI
Tharwat, A. A.; Saleh, M. A comprehensive numerical algorithm for solving service points location problems. (English) Zbl 1094.65062 Appl. Math. Comput. 176, No. 1, 44-57 (2006). MSC: 65K05 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Hoffmann, Michael A simple linear algorithm for computing rectilinear 3-centers. (English) Zbl 1115.68156 Comput. Geom. 31, No. 3, 150-165 (2005). MSC: 68U05 52B55 90B80 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Halman, Nir A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. (English) Zbl 1173.68820 Inf. Process. Lett. 86, No. 3, 121-128 (2003). MSC: 68W05 × Cite Format Result Cite Review PDF Full Text: DOI
Datta, Amitava Efficient parallel range searching and partitioning algorithms. (English) Zbl 0981.68182 Parallel Algorithms Appl. 16, No. 4, 301-317 (2001). MSC: 68W10 68P10 68P05 × Cite Format Result Cite Review PDF Full Text: DOI
Pelegrin, B.; Cánovas, L. A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem. (English) Zbl 0955.90069 Eur. J. Oper. Res. 104, No. 2, 366-374 (1998). MSC: 90B85 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Hwang, R. Z.; Chang, R. C.; Lee, R. C. T. The searching over separators strategy to solve some NP-hard problems in subexponential time. (English) Zbl 0797.68161 Algorithmica 9, No. 4, 398-423 (1993). MSC: 68U05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Hwang, R. Z.; Lee, R. C. T.; Chang, R. C. The slab dividing approach to solve the Euclidean \(P\)-center problem. (English) Zbl 0766.68136 Algorithmica 9, No. 1, 1-22 (1993). MSC: 68U05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Ko, M. T.; Ching, Y. T. Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance. (English) Zbl 0774.68064 Discrete Appl. Math. 40, No. 3, 397-410 (1992). MSC: 68Q25 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Ko, M. T.; Lee, R. C. T. On weighted rectilinear 2-center and 3-center problems. (English) Zbl 0722.90039 Inf. Sci. 54, No. 1-2, 169-190 (1991). Reviewer: P.Loridan (Rantigny) MSC: 90B85 90-08 90C60 × Cite Format Result Cite Review PDF Full Text: DOI
Ko, M. T.; Lee, R. C. T.; Chang, J. S. An optimal approximation algorithm for the rectilinear m-center problem. (English) Zbl 0696.68063 Algorithmica 5, No. 3, 341-352 (1990). MSC: 68Q25 03D15 × Cite Format Result Cite Review PDF Full Text: DOI
Ko, M. T.; Lee, R. C. T.; Chang, J. S. Rectilinear m-center problem. (English) Zbl 0692.90039 Nav. Res. Logist. 37, No. 3, 419-427 (1990). MSC: 90B05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI