Sciweavers

56 search results - page 2 / 12
» Local approximation algorithms for a class of 0 1 max-min li...
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
FOCS
2007
IEEE
14 years 17 days ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 7 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 7 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
14 years 6 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan