Sciweavers

2372 search results - page 436 / 475
» is 2012
Sort
View
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 11 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
11 years 11 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
240views Algorithms» more  SODA 2012»
11 years 11 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
245views Algorithms» more  SODA 2012»
11 years 11 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
278views Algorithms» more  SODA 2012»
11 years 11 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...