Algorithmic Chernoff-Hoeffding inequalities in integer programming

Random Structures and Algorithms

Volumn 8, Issue 1, 1996, Pages 27-58

  Srivastav, Anand ^a   Stangier, Peter ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030304085     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-T     Document Type: Article

References (32)

1. N. Alon, J. Spencer, and P. Erdos, The Probabilistic Method, Wiley, New York, 1992.
2. N. Alon, A parallel algorithmic version of the Local Lemma, Random Struct. Alg. 2, 367-378 (1991).
3. D. Angluin and L. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comp. Sys. Sci., 18, 155-193 (1979).
4. K. Azuma, Weighted sums of certain dependent variables, Tohoku Math. J. 3, 357-367 (1967).
5. c n)-wise independence in NC, JACM, 38(4), 1026-1046 (1991).
6. J. Blazewicz, K. Ecker, G. Schmidt, and J. Wȩglarz, Scheduling in Computer and Manufacturing Systems, Springer-Verlag, Berlin, 1993.
7. R. P. Brent, Fast multiple-precision evaluation of elementary functions, JACM, 23, 242-251 (1976).
8. H. Chernoff, A measure of asymptotic efficiency for test of a hyothesis based on the sum of observation, Ann. Math. Stat., 23, 493-509 (1952).
9. V. Chvatal, The tail of the hypergeometric distribution, Discrete Math., 25, 285-287 (1979).
10. W. F. de la Vega and C. S. Luecker, Bin packing can be solved in within 1 - ε in linear time, Combinatorica, 1, 349-355 (1981).
11. P. Erdos and J. L. Selfridge, On a combinatorial game, J. Combinat. Theor. Ser. A, 14, 298-301 (1973).
12. A. Feldstein and P. R. Turner, Overflow, underflow, and severe loss of significance in floating point addition and subtraction, IMA J. Numer. Anal., 6, 241-251 (1986).
13. M. R. Garey, R. L. Graham, D. S. Johnson, and A. C.-C. Yao, Resource constrained scheduling as generalized bin packing, J. Combinat. Theor. Ser. A, 21, 257-298 (1976).
14. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, New York, 1979.
15. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorical Optimization, Springer-Verlag, New York, 1988.
16. W. Hoeffding, On the distribution of the number of success in independent trials, Ann. Math. Stat., 27, 713-721 (1956).
17. K. L. Krause, V. Y. Shen, and H. D. Schwetmann, Analysis of several job-scheduling algorithms for a model of multiprogramming computer systems, JACM, 22, 522-550 (1975) [Erratum: JACM, 24, 527 (1977)].
18. J. K. Lenstra, D. B. Shmoys, and E. Tardos, Approximating algorithms for scheduling unrelated parallel machines, Math. Program., 46, 259-271 (1990).
19. C. McDiarmid, On the method of bounded differnces, in Surveys in Combinatorics, 1989. J. Siemons, Ed., London Math. Soc. Lecutures Notes, Series 141, Cambridge University Press, Cambridge, 1989.
20. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, New York, 1984.
21. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, Proc. 30th IEEE Conference on Foundation of Computer Science (FOCS'89), 1989, pp. 8-13.
22. J. Naor and M. Naor, Small bias probability spaces: efficient constructions and applications, SIAM J. Comput., 22(4), 838-856 (1993).
23. P. Raghavan and C. D. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7(4), 365-374 (1987).
24. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, J. Comput. Sys. Sci., 37, 130-143 (1988).
25. H. Röck and G. Schmidt, Machine aggregation heuristics in shop scheduling, Math. Oper. Res., 45, 303-314 (1983).
26. J. P. Schmidt, A. Siegel, and A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited independence, Proc. Fourth ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 331-340.
27. J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
28. A. Srivastav and P. Stangier, Weighted fractional and integral k-matchmg in hypergraphs, Discrete Appl. Math. 57, 255-269 (1995).
29. A. Srivastav and P. Stangier, Integer multicommodity flows with, reduced demands, Proc. First European Symposium on Algorithms (ESA '93), Bonn/Bad Honnef, 1993, Lecture Notes in Computer Science, Vol. 726, Springer-Verlag, New York, pp. 360-372.
30. A. Srivastav and P. Stangier, Tight approximations of resource constrained scheduling problems, Proc. Second Annual European Symposium on Algorithms (ESA '94), Utrecht 1994, Lecture Notes in Computer Science, Vol. 855, Springer-Verlag, New York, pp. 307-318.
31. E. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs, Oper. Res., 34, 250-256 (1986).
32. C-K. Yap, Towards exact geometric computation, Proc. 5th Canadian Conference on Computational Geometry, University of Waterloo, 1993, pp. 405-419.