Zobrazeno 1 - 10
of 147
pro vyhledávání: '"D'Angelo, Gianlorenzo"'
Fairness in influence maximization has been a very active research topic recently. Most works in this context study the question of how to find seeding strategies (deterministic or probabilistic) such that nodes or communities in the network get thei
Externí odkaz:
http://arxiv.org/abs/2302.13112
Modeling and shaping how information spreads through a network is a major research topic in network analysis. While initially the focus has been mostly on efficiency, recently fairness criteria have been taken into account in this setting. Most work
Externí odkaz:
http://arxiv.org/abs/2302.13110
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 costs and prizes. The aim is to find a tree in $G$ rooted at $r$ such that
Externí odkaz:
http://arxiv.org/abs/2211.03653
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 temporal path and the distance from $u$ to $v$ is the minimum length (i.e.,
Externí odkaz:
http://arxiv.org/abs/2206.11113
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 \mathbb{R}^+ \cup \{0\}$, a cost function $c:V \rightarrow \mathbb{Z}^
Externí odkaz:
http://arxiv.org/abs/2204.12162
Autor:
Bilò, Davide, D'Angelo, Gianlorenzo, Gualà, Luciano, Leucci, Stefano, Proietti, Guido, Rossi, Mirko
Let $G$ be a directed graph with $n$ vertices, $m$ edges, and non-negative edge costs. Given $G$, a fixed source vertex $s$, and a positive integer $p$, we consider the problem of computing, for each vertex $t\neq s$, $p$ edge-disjoint paths of minim
Externí odkaz:
http://arxiv.org/abs/2106.12293
Publikováno v:
In Journal of Computer and System Sciences May 2024 141
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 of simple games is notably well suited to study the relative importan
Externí odkaz:
http://arxiv.org/abs/2104.03692
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 which one is assumed to be correct. In ODP, the goal is to organise the de
Externí odkaz:
http://arxiv.org/abs/2104.01828