1 citations · 2 across the 5 of their papers we have counts for
6 papers
An Approximation Algorithm for the Connected Maximum Coverage Problem in Directed Graphs
Gianlorenzo D'Angelo, Esmaeil Delfaraz
In the Directed rooted Connected Budgeted maximum Coverage problem (\DRCC), we are given a collection of subsets , defined over a ground set , and a directed graph…
Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes
Gianlorenzo D'Angelo, Esmaeil Delfaraz
In the \emph{budgeted rooted node-weighted Steiner tree} problem, we are given a graph with nodes, a predefined node , two weights associated to each node modelling cost…
Budgeted Out-tree Maximization with Submodular Prizes
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
We consider a variant of the prize collecting Steiner tree problem in which we are given a \emph{directed graph} , a monotone submodular prize function $p:2^V \rightarrow…
Hole Detection and Healing in Hybrid Sensor Networks
Mansoor Davoodi, Esmaeil Delfaraz, Sajjad Ghobadi +1
Although monitoring and covering are fundamental goals of a wireless sensor network (WSN), the accidental death of sensors or the running out of their energy would result in holes…
When Can Liquid Democracy Unveil the Truth?
Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz +1
In this paper, we investigate the so-called ODP-problem that has been formulated by Caragiannis and Micha [10]. Here, we are in a setting with two election alternatives out of whic…
Computation and Bribery of Voting Power in Delegative Simple Games
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Following Zhang and Grossi~(AAAI 2021), we study in more depth a variant of weighted voting games in which agents' weights are induced by a transitive support structure. This class…