649 search results - page 46 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
108
click to vote
ALENEX
2010
15 years 3 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
129
Voted
NETWORKS
2008
15 years 2 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
102
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
167
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
127
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...