###### algorithms

- As another example, in order to accelerate the convergence rate of evolutionary algorithms, fitness approximation-that leads to build model of the fitness function to choose smart search steps-is a good solution. (wikipedia.org)
- In this chapter we introduce the important concept of approximation algorithms. (springer.com)
- Here approximation algorithms must be mentioned in the first place. (springer.com)
- Hochbaum, D.S. [1996]: Approximation Algorithms for NP -Hard Problems. (springer.com)
- Vazirani, V.V. [2001]: Approximation Algorithms. (springer.com)
- Becker, A., and Geiger, D. [1996]: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. (springer.com)
- Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. (springer.com)
- In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. (springer.com)
- I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms. (springer.com)
- Stochastic approximation algorithms are recursive update rules that can be used, among other things, to solve optimization problems and fixed point equations (including standard linear systems) when the collected data is subject to noise. (wikipedia.org)
- Stochastic approximation algorithms have also been used in the social sciences to describe collective dynamics: fictitious play in learning theory and consensus algorithms can be studied using their theory Stochastic approximation methods are a family of iterative stochastic optimization algorithms that attempt to find zeroes or extrema of functions which cannot be computed directly, but only estimated via noisy observations. (wikipedia.org)
- For k-median, vertex-cover, set-cover, min-cut, facility location, Steiner Tree, and the recently introduced "Combinatorial Public Projects" (CPP) problem, we give efficient privacy-preserving approximation algorithms, as well as optimal information theoretic upper and lower bounds. (upenn.edu)
- The Design of Approximation Algorithms , David P. Williamson and David B. Shmoys, Cambridge University Press, 2011. (jhu.edu)
- Approximation algorithms is an area where much progress has been made in the last 10 years. (springer.com)
- In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. (springer.com)
- The book under review concentrates on the … design and analysis of efficient approximation algorithms with good performance guarantees. (springer.com)
- The book gives an overview on the theory of approximation algorithms. (springer.com)
- The book can be used for a graduate course on approximation algorithms. (springer.com)
- A. Blum, New Approximation Algorithms for Graph Colouring , J. ACM 41 (1994) 470-516. (springer.com)
- In this talk we will describe some of the recent developments in approximation algorithms for graph routing problems, and highlight some connections between this area and graph theory. (princeton.edu)
- Her research area is theoretical computer science, with the main emphasis on the design and the analysis of approximation algorithms for NP-hard problems. (princeton.edu)
- Fangjin Yang, creator of Druid, shows how approximation algorithms can help system scale out linearly and process huge amount of data quickly with small memory footprint. (infoq.com)
- This revised and expanded second edition presents a thorough development of the modern theory of stochastic approximation or recursive stochastic algorithms for both constrained and unconstrained problems. (springer.com)
- This problem arises in network testing, as well as in wireless communication.Two polynomial time algorithms that achieve approximation factors of 2H(Δ)+2 and H(Δ)+2 are presented, where Δ is the maximum degree and H is the harmonic function. (umd.edu)

###### trigonometric functions

- In this approximation, trigonometric functions can be expressed as linear functions of the angles. (wikipedia.org)
- This file has several approximations for trigonometric functions. (gamedev.net)

###### good approximation

- For this problem, a rational number a/b is a "good" approximation of a real number α if the absolute value of the difference between a/b and α may not decrease if a/b is replaced by another rational number with a smaller denominator. (wikipedia.org)

###### better approximation

- In particular, we get an efficient approximately truthful mechanism for the CPP problem that achieves a much better approximation ratio than can be achieved efficiently by any exactly truthful mechanism. (upenn.edu)

###### several approximations

- In case the stock pays one or more discrete dividend(s) no closed formula is known, but several approximations can be used, or else the Black-Scholes PDE will have to be solved numerically. (wikipedia.org)

###### Theorem

- We prove an abstract approximation theorem that is applicable to a wide variety of problems, primarily in statistics. (repec.org)
- In particular, the bound in the main approximation theorem is non-asymptotic and the theorem does not require uniform boundedness of the class of functions. (repec.org)
- We study applications of this approximation theorem to local empirical processes and series estimation in nonparametric regression where the classes of functions change with the sample size and are not Donsker-type. (repec.org)

###### calculation

- This approximation is often forced upon the physicists because the calculation with the Grassmann numbers is computationally very difficult in lattice gauge theory. (wikipedia.org)
- Generally, this allows three important approximations (for θ in radians) for calculation of the ray's path, namely: sin θ ≈ θ , tan θ ≈ θ and cos θ ≈ 1. (wikipedia.org)

###### rational functions

- Padé approximation, the approximation of functions by rational functions. (wikipedia.org)

###### Chapter

- This chapter motivates the application of diffusion approximations and explains their correct derivation. (springer.com)
- The chapter addresses mathematicians who are interested in the theory of diffusion approximations and practitioners who wish to apply diffusion models for their specific problems. (springer.com)

###### spaces

- Every subspace of an arbitrary product of Hilbert spaces possesses the approximation property. (wikipedia.org)
- Enflo, P.: A counterexample to the approximation property in Banach spaces. (wikipedia.org)
- 7. Spaces of Approximation Theory. (worldcat.org)