Sciweavers

12519 search results - page 112 / 2504
» Approximation Problems Categories
Sort
View
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
16 years 8 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
15 years 7 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
CP
2005
Springer
16 years 1 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 10 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
SIAMCO
2002
121views more  SIAMCO 2002»
15 years 7 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak