200
Voted
SODA
13 years 4 months ago
2012 ACM 
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
146
click to vote
SODA
13 years 4 months ago
2012 ACM 
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
145
click to vote
SODA
13 years 4 months ago
2012 ACM
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
168
click to vote
SODA
13 years 4 months ago
2012 ACM 
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
149
click to vote
SODA
13 years 4 months ago
2012 ACM 
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
|
Algorithms