4 papers
How many users have been here for a long time? Efficient solutions for counting long aggregated visits
Peyman Afshani, Rezaul Chowdhury, Inge Li Gørtz +3
This paper addresses the Counting Long Aggregated Visits problem, which is defined as follows. We are given users and regions, where each user spends some time visiting som…
Computing Diverse and Nice Triangulations
Waldo Gálvez, Mayank Goswami, Arturo Merino +2
We initiate the study of computing diverse triangulations to a given polygon. Given a simple -gon , an integer , a quality measure on the set of triangulatio…
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
Waldo Gálvez, Mayank Goswami, Arturo Merino +3
There has been considerable recent interest in computing a diverse collection of solutions to a given optimization problem, both in the AI and theory communities. Given a classical…
Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
Per Austrin, Ioana O. Bercea, Mayank Goswami +2
Given a -CNF formula and an integer , we study algorithms that obtain solutions to the formula that are maximally dispersed. For , the problem of computing the diame…