2 citations · 4 across the 3 of their papers we have counts for
3 papers
The Beachcombers' Problem: Walking and Searching with Mobile Robots
Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou +2
We introduce and study a new problem concerning the exploration of a geometric domain by mobile robots. Consider a line segment and a set of mobile robots $r_1,r_2,...,…
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
Eden Chlamtac, Zac Friggstad, Konstantinos Georgiou
Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light o…
Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances
Isaac Fung, Konstantinos Georgiou, Jochen Koenemann +1
We consider the Steiner tree problem in quasi-bipartite graphs, where no two Steiner vertices are connected by an edge. For this class of instances, we present an efficient algorit…