Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...