Using Set Cover to Optimize a Large-Scale Low Latency Distributed Graph.

Rui Wang Christopher Conrad Sam Shah

Published in: HotCloud (2013)

Keyphrases

low latency
set cover
massive scale
greedy algorithm
highly efficient
high speed
np hard
approximation algorithms
real time
virtual machine
high throughput
peer to peer
distributed systems
network flow
mobile agents
solution space
bipartite graph
data intensive
data sets
search algorithm
genetic algorithm