Join Our Newsletter

SODA

2012

ACM

8 years 8 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

8 years 8 months ago
2012

ACM

Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well diﬀerent classes of set functions can be sketched. More...

SODA

2012

ACM

8 years 8 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

8 years 8 months ago
2012

ACM

Every ﬁnite ﬁeld has many multiplicative generators. However, ﬁnding one in polynomial time is an important open problem. In fact, even ﬁnding elements of high order has n...

SODA

2012

ACM

8 years 8 months ago
2012

ACM

A Nash Equilibrium is a joint strategy proﬁle at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...

SODA

2012

ACM

8 years 8 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

8 years 8 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

8 years 8 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...

SODA

2012

ACM

8 years 8 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...

SODA

2012

ACM

8 years 8 months ago
2012

ACM

We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of ﬁnite lattices. We show that every lattice...