Improved Parallel Approximation of a Class of Integer Programming Programming Problems
暂无分享,去创建一个
[1] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[2] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[3] Alan M. Ferrenberg,et al. Monte Carlo simulations: Hidden errors from "good" random number generators. , 1992, Physical review letters.
[4] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.
[5] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Aravind Srinivasan,et al. Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.
[7] Aravind Srinivasan,et al. Improved approximations of packing and covering problems , 1995, STOC '95.
[8] Prabhakar Raghavan,et al. Randomized algorithms and pseudorandom numbers , 1993, JACM.
[9] Tsan-Sheng Hsu,et al. Graph augmentation and related problems: theory and practice , 1993 .
[10] Moni Naor,et al. The Probabilistic Method Yields Deterministic Parallel Algorithms , 1994, J. Comput. Syst. Sci..
[11] Aravind Srinivasan,et al. Improved algorithms via approximations of probability distributions (extended abstract) , 1994, STOC '94.
[12] Bonnie Berger,et al. Simulating (logcn)-wise independence in NC , 1991, JACM.
[13] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[14] Paul Erdös,et al. Optima of dual integer linear programs , 1988, Comb..
[15] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[16] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[17] Aravind Srinivasan,et al. An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.
[18] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[19] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[20] Michael Luby. Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..
[21] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..