Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
A heuristic for the p-center problem in graphs
Discrete Applied Mathematics
An optimal-time algorithm for slope selection
SIAM Journal on Computing
Randomized optimal algorithm for slope selection
Information Processing Letters
Wireless information networks
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
More planar two-center algorithms
Computational Geometry: Theory and Applications
Parametric search made practical
Proceedings of the eighteenth annual symposium on Computational geometry
Facility Location Constrained to a Polygonal Domain
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Efficient Algorithms for Two-Center Problems for a Convex Polygon
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
Base station placement on boundary of a convex polygon
Journal of Parallel and Distributed Computing
Fast computation of smallest enclosing circle with center on a query line segment
Information Processing Letters
Polynomial time approximation schemes for base station coverage with minimum total radii
Computer Networks: The International Journal of Computer and Telecommunications Networking
Constrained minimum enclosing circle with center on a query line segment
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Given a set P of n points and a straight line L, we study three important variations of minimum enclosing circle problem as follows: