An Epsilon-Approximation Scheme for Minimum Variance Combinatorial Problems

2935 22 2974 3 5909 document 2974 WP-87-117.pdf application/pdf 1746e5ce1426168beb36be84b28c37f6 MD5 536803 2016-01-15 01:57:36 https://pure.iiasa.ac.at/id/eprint/2935/1/WP-87-117.pdf 2935 1 1 text en public

WP-87-117.pdf

22 3bf1d849bdea8aa4f5db2af9eeb6af2132122e00 18815 2 30545 document 18815 lightbox.jpg image/png e10e2424edbd45a917304d886a436563 MD5 12855 2016-01-15 13:29:11 https://pure.iiasa.ac.at/id/eprint/2935/2/lightbox.jpg 2935 2 2 image/png other Thumbnails conversion from text to thumbnail_lightbox en public

lightbox.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/islightboxThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2974 18816 2 30546 document 18816 preview.jpg image/png 5237c96e2405a8d98d4478bfa5f53681 MD5 6977 2016-01-15 13:29:12 https://pure.iiasa.ac.at/id/eprint/2935/3/preview.jpg 2935 3 3 image/png other Thumbnails conversion from text to thumbnail_preview en public

preview.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/ispreviewThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2974 18817 2 30547 document 18817 medium.jpg image/png 862aec3aca23faf087c2e89dbf81bca8 MD5 2484 2016-01-15 13:29:13 https://pure.iiasa.ac.at/id/eprint/2935/4/medium.jpg 2935 4 4 image/png other Thumbnails conversion from text to thumbnail_medium en public

medium.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/ismediumThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2974 18818 2 30548 document 18818 small.jpg image/png 8714049feb0ddff2e70771e41e1084be MD5 1063 2016-01-15 13:29:14 https://pure.iiasa.ac.at/id/eprint/2935/5/small.jpg 2935 5 5 image/png other Thumbnails conversion from text to thumbnail_small en public

small.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/issmallThumbnailVersionOf https://pure.iiasa.ac.at/id/document/2974 18820 1 30550 document 18820 indexcodes.txt text/x-pascal 118fbf07031abbf24b3939e5b9d776c1 MD5 5492 2016-01-15 13:29:16 https://pure.iiasa.ac.at/id/eprint/2935/6/indexcodes.txt 2935 6 6 text/x-pascal other Generate index codes conversion from text to indexcodes en public

indexcodes.txt

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isIndexCodesVersionOf https://pure.iiasa.ac.at/id/document/2974 82138 2 230476 document 82138 WP-87-117.pdf application/pdf 29ce0dfd847f7f3068721c00f7cf97a7 MD5 1232241 2018-03-14 08:30:11 https://pure.iiasa.ac.at/id/eprint/2935/7/WP-87-117.pdf 2935 7 7 application/pdf other Coversheet version en public

WP-87-117.pdf

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/2974 http://eprints.org/relation/isCoversheetVersionOf https://pure.iiasa.ac.at/id/document/2974 archive 351 disk0/00/00/29/35 2016-01-15 01:57:36 2021-08-27 17:12:54 2016-01-15 01:57:36 monograph show 2 Katoh N. AL0823 An Epsilon-Approximation Scheme for Minimum Variance Combinatorial Problems pub iis_met iis_mod prog_mda prog_sds 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. 1987-11 published WP-87-117 WP-87-117 10 2015 public working_paper IIASA, Laxenburg, Austria 27 FALSE info:eu-repo/semantics/book