Strong hardness of approximation for tree transversals

strong approximation for itô stochastic differential equations

in this paper, a class of semi-implicit two-stage stochastic runge-kutta methods (srks) of strong global order one, with minimum principal error constants are given. these methods are applied to solve itô stochastic differential equations (sdes) with a wiener process. the efficiency of this method with respect to explicit two-stage itô runge-kutta methods (irks), it method, milstien method, sem...

3 Hardness of Approximation

Hardness of Approximation

This article accompanies the talk given by the author at the International Congress of Mathematicians, 2014. The article sketches some connections between approximability of NP-complete problems, analysis and geometry, and the role played by the Unique Games Conjecture in facilitating these connections. For a more extensive introduction to the topic, the reader is referred to survey articles [3...

Approximation algorithms and the hardness of approximation

Chandra Chekuri (Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL), Joseph Cheriyan (Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, ON), Ryan O’Donnell (School of Computer Science, Carnegie Mellon University, Pittsburgh, PA), Mohammad R. Salavatipour (Dept. of Computing Science, University of Alberta, Edmonton, AL), David Williamson (...

Approximation Algorithms and Hardness of Approximation

S (in alphabetic order by speaker surname) Speaker: Hyung-Chan An (EPFL, Lausanne) Title: LP-Based Algorithms for Capacitated Facility Location Abstract: Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algori...