23 citations · 51 across the 26 of their papers we have counts for
4 papers · 1 filter
A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery
Arash Vaezi, Mohammad Ghodsi
Given a simple polygon , in the Art Gallery problem the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can s…
Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits
Mohammad Ghodsi, Amirmahdi Mirfakhar
The classic cake-cutting problem provides a model for addressing the fair and efficient allocation of a divisible, heterogeneous resource among agents with distinct preferences. Fo…
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades +1
The -center problem is to choose a subset of size from a set of points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\l…
Art Gallery Plus Single Specular-reflection
Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi
Given a simple polygon , in the Art Gallery problem, the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can…