Minmax-distance approximation and separation problems: geometrical properties
نویسندگان
چکیده
منابع مشابه
Approximation of the minmax interpolator
We consider approximation of the optimal Yen algorithm for interpolation from a nonuniformly-spaced grid. Although the Yen interpolator is optimal in many senses, it suffers from severe numerical ill conditioning. We suggest a tradeoff between accuracy in computing the interpolator and accuracy in performing the interpolation. A new interpolator is proposed using Choi’s expression for interpola...
متن کاملApproximation Algorithms for Geometric Separation Problems
In computer graphics and solid modeling, one is interested in representing complex geometric objects with combinatorially simpler ones. It turns out that via a “fattening” transformation, one obtains a formulation of the approximation problem in terms of separation: Find a minimumcomplexity surface that separates two sets. In this paper, we provide approximation algorithms for several geometric...
متن کاملExact and heuristic algorithms for MinMax Channel Assignment Problems modeled as distance geometry graph coloring
One of the most important combinatorial optmization problems is graph coloring. There are several versions of this problem, involving additional constraints on the vertices or edges. They constitute models for real applications, such as channel assignment in mobile wireless networks. In this work, we consider some of these graph coloring models, involving distance constraints on the edges. The ...
متن کاملLogspace Optimisation Problems and their Approximation Properties
This paper introduces logspace optimisation problems as analogues of the well-studied polynomial-time optimisation problems. Similarly to them, logspace optimisation problems can have vastly different approximation properties, even though the underlying existence and budget problems have the same computational complexity. Numerous natural problems are presented that exhibit such a varying compl...
متن کاملCVaR distance between univariate probability distributions and approximation problems
We define new distances between univariate probability distributions, based on the concept of the CVaR norm. The problem of approximation of one discrete probability distribution by another one, potentially with a smaller number of outcomes, is considered. Such problems arise in the context of scenario reduction and the approximation is performed by minimizing the new distance. We find: (i) opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2010
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-010-0387-1