activity
20152019
most citedApproximation algorithms for the two-center problem of convex polygon

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.CG2019

Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74

Sanjib Sadhu, Xiaozhou He, Sasanka Roy +2

In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is propos…