2031 search results - page 167 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
113
Voted
DAM
2007
15 years 2 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
121
Voted
COLT
2008
Springer
15 years 4 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
163
click to vote
FOGA
2011
14 years 5 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
147
click to vote
CGO
2011
IEEE
14 years 6 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
174
click to vote
OL
2011
14 years 9 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...