Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner

To reduce space and time complexity, we define a new storage technique for these relations which reduces the complexity of establishing a form of strong directional path consis-

It is known that large fragments of the class of dense Minimum Constraint Sat- isfaction (MIN-CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a

As an application, we show how observability properties for the time continuous model yield uniform (with respect to the time-step) observability results for its time-discrete

APX or DAPX: the class of problems for which there exists a polynomial algorithm achieving standard or differential approximation ratio f ( | x | ) where function f is constant (it

Chapter 3 Computing approximate optimal designs on semialgebraic design spaces using the Lasserre hierarchy of lower bounds.. Chapter 4 Outer approximations of semialgebraic sets

(c) The normalized transmission intensity (color scale) of the unfocused 800 nm beam as a function of the quarter wave plate (QWP) and polarizer angle in degrees.. (d) The intensity