Tools
Tools
Katoh, N. (1987). An Epsilon-Approximation Scheme for Minimum Variance Combinatorial Problems. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-87-117
Preview |
Text
WP-87-117.pdf Download (536kB) | Preview |
Abstract
Suppose that we are given a finite set E, a family of feasible subsets of E and an integer cost associated with each element in E. The author considers the problem of finding a feasible subset such that the variance among the costs of elements in the subset is minimized. The author shows that if one can solve the corresponding minimum cost problem in polynomial time, it is possible to construct a fully polynomial time approximation scheme for the above minimum variance problem.
| Item Type: | Monograph (IIASA Working Paper) |
|---|---|
| Research Programs: | Methodology of Decision Analysis (MDA) System and Decision Sciences - Core (SDS) |
| Depositing User: | IIASA Import |
| Date Deposited: | 15 Jan 2016 01:57 |
| Last Modified: | 27 Aug 2021 17:12 |
| URI: | https://pure.iiasa.ac.at/2935 |
Actions (login required)
 |
View Item |