Search Results for author:
Found 2 papers, 0 papers with code
The Maximum Cover with Rotating Field of View
More formally, we define the following maximum cover problem: "Given a convex polygon $P$ and a Field Of View (FOV) with a given centre and inner angle $\phi$; find the direction (an angle of rotation $\theta$) of the FOV such that the intersection between the FOV and $P$ has the maximum area".
Optimizing Reachability Sets in Temporal Graphs by Delaying
The second, imposes independent delays on the time labels of every edge of the graph. cWe provide a thorough investigation of the computational complexity of different objectives related to reachability sets when these operations are used.
Epidemiology
Data Structures and Algorithms
Computational Complexity
Computers and Society
Social and Information Networks
