Sciweavers

364 search results - page 26 / 73
» Shortest-path network interdiction
Sort
View
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
14 years 5 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
DAM
2010
64views more  DAM 2010»
13 years 7 months ago
Network flow interdiction on planar graphs
Rico Zenklusen
INFORMS
2007
50views more  INFORMS 2007»
13 years 7 months ago
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
Johannes O. Royset, R. Kevin Wood
AAAI
2011
12 years 7 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev