|
|
|
|
|
Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo and Eleanor G. Rieffel
We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of w...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mauro Dell?Amico, Jafar Jamal and Roberto Montemanni
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presente...
ver más
|
|
|
|
|
|
|
|
|
|
|
Rakesh Kawatra
We present an integer programming formulation of the min-sum arborescence with node outage costs problem. The solution to the problem consists of selecting links to connect a set of terminal nodes to a root node with minimal expected annual cost, where t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Joaquim Espada, Alexandre P. Francisco, Tatiana Rocher, Luís M. S. Russo and Cátia Vaz
Let ??=(??,??)
G
=
(
V
,
E
)
be a directed and weighted graph with a vertex set V of size n and an edge set E of size m such that each edge (??,??)???
(
u
,
v
)
?
E
has a real-valued weight ??(??,??)
w
(
u
,
c
)
. An arborescence in G is a subgraph ??=...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohammad Abouei Mehrizi and Gianlorenzo D'Angelo
Nowadays, many political campaigns are using social influence in order to convince voters to support/oppose a specific candidate/party. In election control via social influence problem, an attacker tries to find a set of limited influencers to start diss...
ver más
|
|
|
|
|
|