676 search results - page 64 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
150
click to vote
MP
2008
15 years 6 months ago
2008
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
173
click to vote
AAAI
2012
13 years 8 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
156
click to vote
ICTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
145
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
161
click to vote
JCO
2010
15 years 4 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...