Approximation algorithms for orthogonal line centers
From MaRDI portal
Publication:831691
DOI10.1007/978-3-030-67899-9_4OpenAlexW3127975013MaRDI QIDQ831691FDOQ831691
Authors: 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
Recommendations
- Approximation algorithms for orthogonal line centers
- scientific article; zbMATH DE number 1947381
- Approximating \(k\)-orthogonal line center
- Approximation algorithms for a \(k\)-line center
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
- scientific article; zbMATH DE number 1003238
- An optimal approximation algorithm for the rectilinear m-center problem
- A near-linear algorithm for the planar segment-center problem
- Approximation algorithms for aligning points
- Approximation algorithms for aligning points
Cites Work
- Matching theory
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Generalized Selection and Ranking: Sorted Matrices
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- SEPARATING POINTS BY AXIS-PARALLEL LINES
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
- Approximation algorithms for a \(k\)-line center
- The two-line center problem from a polar view: a new algorithm and data structure
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
- Approximating \(k\)-orthogonal line center
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- Approximation algorithms for projective clustering
Cited In (4)
This page was built for publication: Approximation algorithms for orthogonal line centers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831691)
