AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS
نویسندگان
چکیده
منابع مشابه
An E-approximation Scheme for Minimum Variance Problems
Abstmct Minimum variance problem may arise when we want to allocate a given amount of resource as fairly as possible to a finite set of activities under certain constraints. More formally, it is described as follows. Given a finite set E, a subset S of RE, and a function he(x(e)) from a certain domain to R for each e E E (which represents the profit resulting from ailocating x(e) amount of reso...
متن کاملA Distributed Minimum Cut Approximation Scheme
In this paper, we study the problem of approximating the minimum cut in a distributed message-passing model, the CONGEST model. The minimum cut problem has been well-studied in the context of centralized algorithms. However, there were no known non-trivial algorithms in the distributed model until the recent work of Ghaffari and Kuhn. They gave algorithms for finding cuts of size O(ǫλ) and (2 +...
متن کاملExistence Results for Generalized ε-Vector Equilibrium Problems
This paper studies some existence results for generalized epsilon-vector equilibrium problems and generalized epsilon-vector variational inequalities. The existence results for solutions are derived by using the celebrated KKM theorem. The results achieved in this paper generalize and improve the works of many authors in references.
متن کاملVC Dimension, ε-nets and ε-approximation
“I’ve never touched the hard stuff, only smoked grass a few times with the boys to be polite, and that’s all, though ten is the age when the big guys come around teaching you all sorts to things. But happiness doesn’t mean much to me, I still think life is better. Happiness is a mean son of a bitch and needs to be put in his place. Him and me aren’t on the same team, and I’m cutting him dead. I...
متن کاملApproximation Algorithms for Minimum Span Channel Assignment Problems
We propose polynomial time approximation algorithms for minimum span channel (frequency) assignment problems, which is known to be NP-hard. Let α be the approximation ratio of our algorithm and W ≥ 2 be the maximum of numbers of channels required in vertices. If an instance is defined on a perfect graph G, then α ≤ 1+ (1+ 1 W−1 )Hω(G), where Hi denotes the i-th harmonic number. For any instance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1990
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.33.46