Sciweavers

4894 search results - page 72 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
14 years 11 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
15 years 5 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
SIAMCO
2002
121views more  SIAMCO 2002»
14 years 11 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
AMC
2004
105views more  AMC 2004»
14 years 11 months ago
Block matrix Sinc-Galerkin solution of the wind-driven current problem
A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an...
Sanoe Koonprasert, Kenneth L. Bowers
IPL
2006
151views more  IPL 2006»
14 years 11 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier