Sciweavers

Share
SODA
2012
ACM
262views Algorithms» more  SODA 2012»
7 years 4 months ago
A polynomial-time approximation scheme for planar multiway cut
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,...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
7 years 4 months ago
Sketching valuation functions
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...
Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu,...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
7 years 4 months ago
Constant factor approximation algorithm for the knapsack median problem
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...
Amit Kumar
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
7 years 4 months ago
Constructing high order elements through subspace polynomials
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...
Qi Cheng, Shuhong Gao, Daqing Wan
SODA
2012
ACM
278views Algorithms» more  SODA 2012»
7 years 4 months ago
Beyond myopic best response (in Cournot competition)
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...
Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yish...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
7 years 4 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
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 ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
7 years 4 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
7 years 4 months ago
Analyzing graph structure via linear measurements
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...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
7 years 4 months ago
Kernelization of packing problems
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...
Holger Dell, Dániel Marx
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
7 years 4 months ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...
books