Gianlorenzo D'angelo

activity

20162026

most citedSelecting nodes and buying links to maximize the information diffusion in a network

8 citations · 12 across the 13 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

cs.DS2022★ 1 cited

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 $G$ with $n$ nodes, a predefined node $r$ , two weights associated to each node modelling cost…

cs.DS2022

Sparse Temporal Spanners with Low Stretch

Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà +2

A temporal graph is an undirected graph $G = (V, E)$ along with a function that assigns a time-label to each edge in $E$ . A path in $G$ with non-decreasing time-labels is called tempo…

cs.DS2022

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} $D = (V, A)$ , a monotone submodular prize function $p:2^V \rightarrow…