Approximation algorithms for orthogonal line centers

DOI10.1007/978-3-030-67899-9_4OpenAlexW3127975013MaRDI QIDQ831691

Arun Kumar Das, Sandip Das, Joydeep Mukherjee

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_4

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Approximation algorithms for a \(k\)-line center
• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
• Approximating \(k\)-orthogonal line center
• Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
• Generalized Selection and Ranking: Sorted Matrices
• SEPARATING POINTS BY AXIS-PARALLEL LINES
• Bi-criteria linear-time approximations for generalized k-mean/median/center
• Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• Approximation algorithms for projective clustering
• The two-line center problem from a polar view: a new algorithm and data structure

This page was built for publication: Approximation algorithms for orthogonal line centers