|
|
|
|
|
Daeyoub Kim and Jihoon Lee
One of the most common approaches for enhancing network performance is to retrieve data from nearby data holders that have previously obtained the desired data, not only from the original data source itself. In this case, since a data receiver cannot ide...
ver más
|
|
|
|
|
|
|
|
|
Junxin Huang, Yuchuan Luo, Ming Xu, Bowen Hu and Jian Long
Online ride-hailing (ORH) services allow people to enjoy on-demand transportation services through their mobile devices in a short responding time. Despite the great convenience, users need to submit their location information to the ORH service provider...
ver más
|
|
|
|
|
|
|
|
|
Davide Bilò, Luciano Gualà and Guido Proietti
Consider a communication network represented by a directed graph ??=(??,??)
G
=
(
V
,
E
)
of n nodes and m edges. Assume that edges in E are partitioned into two sets: a set C of edges with a fixed non-negative real cost, and a set P of edges whose cost...
ver más
|
|
|
|
|
|
|
|
|
Mattia D?Emidio
Computing shortest-path distances is a fundamental primitive in the context of graph data mining, since this kind of information is essential in a broad range of prominent applications, which include social network analysis, data routing, web search opti...
ver más
|
|
|
|
|
|
|
|
|
Víctor Pacheco-Valencia, José Alberto Hernández, José María Sigarreta and Nodari Vakhania
The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who has to visit each of the locations from a given set exactly once, starting and ending at the same location. Here, we consider the Euclidean version of the problem,...
ver más
|
|
|
|