SODA
2014
ACM
9 years 6 months ago
2014
ACM
119
click to vote
WDAG
2013
Springer
10 years 7 months ago
2013
Springer
We study the problem of computing approximate minimum edge cuts by distributed algorithms. We present two randomized approximation algorithms that both run in a standard synchrono...
SODA
2012
ACM
12 years 1 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,...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
SODA
2012
ACM
12 years 1 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...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
SODA
2012
ACM
12 years 1 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...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
SODA
2012
ACM
12 years 1 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...