168 search results - page 13 / 34 » On Nontrivial Approximation of CSPs |
CONSTRAINTS
1998
13 years 10 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
FOCM
2011
2011
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
13 years 5 months ago
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
SIAMSC
2011
13 years 5 months ago
2011
Abstract. Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can ...
ALGORITHMICA
2004
13 years 10 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...