Abstract
k orthogonal line center problem computes a set of k axis-parallel lines for a given set of points in 2D such that the maximum among the distance between each point to its nearest line is minimized. A 2-factor approximation algorithm and a \((\frac{7}{4}, \frac{3}{2})\) bi-criteria approximation algorithm is presented for the problem. Both of them are deterministic approximation algorithms, having sub-quadratic running time and not based on linear programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agarwal, P.K., Procopiuc, C.M.: Approximation algorithms for projective clustering. J. Algorithms 46(2), 115–139 (2003)
Agarwal, P.K., Procopiuc, C.M., Varadarajan, K.R.: A (1+ \(\varepsilon \))-approximation algorithm for 2-line-center. Comput. Geomet. 26(2), 119–128 (2003)
Agarwal, P.K., Procopiuc, C.M., Varadarajan, K.R.: Approximation algorithms for a k-line center. Algorithmica 42(3), 221–230 (2005)
Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S.: Fast algorithms for projected clustering, p. 61–72. Association for Computing Machinery, New York, June 1999
Aggarwal, C.C., Yu, P.S.: Finding generalized projected clusters in high dimensional spaces. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD 2000, pp. 70–81. Association for Computing Machinery, New York (2000)
Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. ACM SIGMOD Rec. 27(2), 94–105 (1998)
Chakraborty, B., Das, A.K., Das, S., Mukherjee, J.: Approximating k-orthogonal line center. In: Wu, W., Zhang, Z. (eds.) COCOA 2020. LNCS, vol. 12577, pp. 47–60. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-64843-5_4
Călinescu, G., Dumitrescu, A., Karloff, H., Wan, P.J.: Separating points by axis-parallel lines. Int. J. Comput. Geomet. Appl. 15(06), 575–590 (2005)
Dom, M., Fellows, M.R., Rosamond, F.A.: Parameterized complexity of stabbing rectangles and squares in the plane. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 298–309. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00202-1_26
Feldman, D., Fiat, A., Sharir, M., Segev, D.: Bi-criteria linear-time approximations for generalized k-mean/median/center. In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry, SCG 2007, pp. 19–26. Association for Computing Machinery, New York (2007)
Frederickson, G.N., Johnson, D.B.: Generalized selection and ranking: sorted matrices. SIAM J. Comput. 13(1), 14–30 (1984)
Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. J. Algorithms 43(1), 138–152 (2002)
Jaromczyk, J.W., Kowaluk, M.: The two-line center problem from a polar view: a new algorithm and data structure. In: Akl, S.G., Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 13–25. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60220-8_47
Koushanfar, F., Slijepcevic, S., Potkonjak, M., Sangiovanni-Vincentelli, A.: Error-tolerant multimodal sensor fusion. In: IEEE CAS Workshop on Wireless Communication and Networking, pp. 5–6 (2002)
Lovász, L., Plummer, M.D.: Matching Theory, vol. 367. American Mathematical Soc. (2009)
Procopiuc, C.M., Jones, M., Agarwal, P.K., Murali, T.M.: A Monte Carlo algorithm for fast projective clustering. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002, pp. 418–427. Association for Computing Machinery, New York (2002)
Renner, W.D., Pugh, N.O., Ross, D.B., Berg, R.E., Hall, D.C.: An algorithm for planning stereotactic brain implants. Int. J. Radiat. Oncol. Biol. Phys. 13(4), 631–637 (1987)
Tansel, B.C., Francis, R.L., Lowe, T.J.: State of the art-location on networks: a survey. Part I: the p-center and p-median problems. Manage. Sci. 29(4), 482–497 (1983)
Zanjirani Farahani, R., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-7908-2151-2
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Das, A.K., Das, S., Mukherjee, J. (2021). Approximation Algorithms for Orthogonal Line Centers. In: Mudgal, A., Subramanian, C.R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2021. Lecture Notes in Computer Science(), vol 12601. Springer, Cham. https://doi.org/10.1007/978-3-030-67899-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-67899-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67898-2
Online ISBN: 978-3-030-67899-9
eBook Packages: Computer ScienceComputer Science (R0)