Sciweavers

2283 search results - page 413 / 457
» Bounds of Graph Characteristics
Sort
View
IMC
2010
ACM
13 years 5 months ago
On the impact of layer-2 on node degree distribution
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...
Pascal Mérindol, Benoit Donnet, Olivier Bon...
INFOCOM
2010
IEEE
13 years 5 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
13 years 5 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
WINE
2010
Springer
178views Economy» more  WINE 2010»
13 years 5 months ago
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
Patrick Briest, Parinya Chalermsook, Sanjeev Khann...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 5 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...