Combinatorial problems of packing and covering and related problems of integer linear programming

Journal of Mathematical Sciences

Volumn 108, Issue 1, 2002, Pages 1-48

  Kuzjurin, N N ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19644391051     PISSN: 10723374     EISSN: 15738795     Source Type: Journal    
DOI: 10.1023/A:1012778715468     Document Type: Article

References (109)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts (1975).
2. L. A. Bassalygo and V. A. Zinov'ev, "Some simple corollaries from code theory for the combinatorial problems of packing and covering," Mat. Zametki, 34, 291-295 (1983).
3. G. P. Gavrilov and A. A. Sapozhenko, Collection of Problems in Discrete Mathematics [in Russian], Nauka, Moscow (1992).
4. M. R. Garey and D. S. Johnson, Computers and Intractability [Russian translation], Mir, Moscow (1982).
5. G. A. Kabatyanskii and V. I. Panchenko, "Packings and coverings of Hamming space by unit spheres," Dokl. Akad. Nauk SSSR, 303, No. 3, 550-552 (1988).
6. G. A. Kabatyanskii and V. I. Panchenko, "Packings and coverings of Hamming space by unit spheres," Probl. Peredachi Inform., 24, No. 3, 3-16 (1988).
7. R. M. Carp, "Reduction of combinatorial problems," Kibern. Sb., 12 (1975).
8. A. N. Kolmogorov and V. M. Tikhomirov, "ε-Entropy and ε-capacity of sets in function spaces," Usp. Mat. Nauk, 14, No. 2, 3-86 (1959).
9. N. N. Kuzjurin, "Asymptotic investigation of the covering problem," Probl. Kibern., 37, 19-56 (1980).
10. N. N. Kuzjurin, "Values of an objective function that are majorated by the mean value and the problem of α-depth of (0, 1)-matrices," in: Republic Workshop on Discrete Optimization [in Russian], Institute of Cybernetics, Kiev (1985), pp.73-74.
11. N. N. Kuzjurin, "Asymptotically exact polynomial algorithms in integer linear programming," Diskr. Mat., 1, No. 2, 78-85 (1989).
12. N. N. Kuzjurin, "On the ratio of optima in problems of linear and integer linear programming," Diskret. Mat., 3, No. 1, 98-104 (1991).
13. N. N. Kuzjurin, "Metric relations in integer linear programming," Dokl. Ross. Akad. Nauk, 340, No. 3, 308-310 (1995).
14. N. N. Kuzjurin, "Metric aspects of integer linear programming theory," Diskret. Mat., 6, No. 4, 87-106 (1994).
15. N. N. Kuzjurin, "Estimation of optima in ILP problems of the covering and packing type," Combinatorial Models and Methods [in Russian], Computer Center of the Russian Academy of Sciences, Moscow (1996).
16. N. N. Kuzjurin, "On the maximal α-depth of (0,1)-matrices in the Ryser classes," Dokl. Ross. Akad. Nauk, 350, No. 1, 12-13 (1996).
17. N. N. Kuzjurin, "Almost optimal numerations of asymptotically good coverings and packings," in Combinatorial Models and Methods [in Russian], Computer Center of the Russian Academy of Sciences, Moscow (1997), pp.12-29.
18. V. K. Leont'ev, "Upper estimate of the α-depth of a (0, 1)-matrix," Mat. Zametki, 15, No. 3, 421-429 (1974).
19. V. K. Leont'ev, "Discrete extremal problems," in: Progress in Sciences and Technology, Series of Mathematical Statistics and Cybernetics [in Russian], All-Union Institute for Scientific and Technical Information (VINITI), Akad. Nauk SSSR, Moscow (1979), pp.39-101.
20. F. J. MacWilliams and N. J. Sloane, The Theory of Error Correcting Codes [Russian translation], Mir, Moscow (1979).
21. M. P. Mineev and A. I. Pavlov, "On the number of (0-1)-matrices with given sums in rows and columns," Dokl. Akad. Nauk SSSR, 230, No. 2, 271-274 (1976).
22. E. I. Nechiporuk, "On the complexity of gate schemes that realize Boolean matrices with indefinite elements," Dokl. Akad. Nauk SSSR, 163, No. 1, 40-43 (1965).
23. R. G. Nigmatullin, "Steepest descent method in covering problems," Voprosy Tochnosti Effektivnosti Algoritmov (Kiev), 5, 116-126 (1969).
24. V. A. Nosov, V. N. Sachkov, and V. E. Tarakanov, "Combinatorial analysis (nonnegative matrices, algorithmic problems)," in: Progress in Science and Technology, Series on Mathematical Statistics and Theoretical Cybernetics [in Russian], All-Union Institute for Scientific and Technical Information (VINITI), Akad. Nauk SSSR, Moscow (1983), pp.120-178.
25. H. Ryser, Combinatorial Mathematics [Russian translation], Mir, Moscow (1966).
26. C. Rodgers, Packings and Coverings [Russian translation], Mir, Moscow (1968).
27. A. A. Sapozhenko, A. S. Asratyan, and N. N. Kuzjurin, "A survey of some results in covering problems," in: Discrete Analysis Methods in the Solution of Combinatorial Problems [in Russian], Novosibirsk (1977), pp.46-75.
28. V. N. Sachkov, Combinatorial Methods in Discrete Mathematics [in Russian], Nauka, Moscow (1977).
29. V. N. Sachkov, Random Methods in Combinatorial Analysis [in Russian], Nauka, Moscow (1978).
30. A. Schreiver, Linear and Integer Programming Theory, Vols. 1, 2 [Russian translation], Mir, Moscow (1991).
31. V. E. Tarakanov, Combinatorial Problems and (0, 1)-Matrices [in Russian], Nauka, Moscow (1985).
32. V. E. Tarakanov, "Maximal depth of arbitrary classes of (0, 1)-matrices and some applications," Mat. Sb., 92, 472-490 (1973).
33. V. E. Tarakanov, "On the maximum depth of a class of (0, 1)-matrices," Mat. Sb., 92, No. 1, 4-14 (1968).
34. V. E. Tarakanov, "On the depth of (0, 1)-matrices with equal row and column sums," Mat. Zametki, 34, No. 3, 463-476 (1983).
35. L. Ford and D. Falkerson, Currents in Networks [Russian translation], Mir, Moscow (1966).
36. L. G. Khachiyan, "Polynomial algorithms in linear programming," Dokl. Akad. Nauk SSSR, 244, 1093-1096 (1979).
37. M. Hall, Combinatorial Theory [Russian translation], Mir, Moscow (1970).
38. P. Erdös and J. Spencer, Probabilistic Methods in Combinatorics, Akadémiai Kiadó, Budapest (1974).
39. R. Aharoni, P. Erdös, and N. Linial, "Dual integer linear programs and the relationship between their optima," in: Proc. 17th Annual Symp. Theory Computing (1985), pp.476-483.
40. R. Aharoni, P. Erdos, and N. Linial, "Optima of dual integer linear programs," Combinatorica, 8, No. 1 476-483 (1988).
41. N. Alon, J.-H. Kim, and J. H. Spencer, "Nearly perfect matchings in regular simple hypergraphs," Preprint (1996).
42. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley and Sons, New York (1992).
43. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, "Construction of asymptotically good, low-rate error-correcting codes through pseudorandom graphs," IEEE Trans. Inf. Theory, 38, 509-516 (1992).
44. D. Angluin and L. G. Valiant, "Fast probabilistic algorithms for Hamiltonian circuits and matchings," J. Comput. Syst. Sci., 19, 155-193 (1979).
45. B. Awerbuch and Y. Azar, "Local optimization of global objectives: competitive distributed dead-lock resolution and resource allocation," in: 35th Annual IEEE Symp. Found. Computer Sci. (1994), pp.240-249.
46. Y. Bartal, J. H. Byers, and D. Raz, "Global optimization using local information with applications to flow control," in: 38th Annual IEEE Symp. Found. Computer Sci. (1997), pp.303-312.
47. J. Beck and T. Fiala, " 'Integer-making' theorems," Discrete Appl. Math., 3, 1-8 (1981).
48. F. R. K. Chung, "Constructing random-like graphs," in: Proc. Symp. Appl. Math., 44, 21-55 (1991).
49. V. Chvatal, "A greedy heuristic for the set covering problem," Math. Oper. Res., 4, 233-235 (1979).
50. S. D. Cohen and N. N. Kuzjurin, "On (n, k, l, △)-systems," Proc. Edinburgh Math. Soc., 38, 53-62 (1995).
51. P. Erdös and H. Hanani, "On a limit theorem in combinatorial analysis," Publ. Math. Debrecen, 10, 10-13 (1963).
52. P. Erdös and L. Lovász, "Problems and results on 3-chromatic hypergraphs and some related questions," in: A. Hajnal et al. (eds.), Infinite and Finite Sets, North-Holland, Amsterdam, pp.609-628.
53. H. Iwaniec and J. Pintz, "Primes in short intervals," Monatsh. Math., 98, 115-143 (1984).
54. S. M. Johnson, "A new upper bound for error-correcting codes," IRE Trans. Inform. Theory, 8, 203-207 (1962).
55. D. S. Johnson, "Approximation algorithms for combinatorial problems," Discr. Math., 9, 256-278 (1974).
56. U. Feige, "A threshold of In n for approximating set covers," in: Proc. ACM Symposium on Theory of Computing (1996).
57. D. R. Fulkerson and H. J. Ryser "Widths and heights of (0, 1)-matrices," Can. J. Math., 13, No. 2, 239-255 (1961).
58. D. R. Fulkerson and H. J. Ryser, "Widths sequences for special classes of (0, 1)-matrices," Can. J. Math., 15, No. 3, 371-396 (1963).
59. Z. Furedi, "Hatchings and covers in hypergraphs," Graphs and Combinatorics, 4, 115-206 (1988).
60. P. Frankl and V. Rödl, "Near perfect coverings in graphs and hypergraphs," Europ. J. Combinatorics, 6, 317-326 (1985).
61. A. P. Godbole, S. E. Tompson, and E. Vigoda, "General upper bounds for covering numbers," ARS Combinatoria, 46, 211-221 (1996).
62. D. M. Gordon, G. Kuperberg, O. Patashnik, and J. H. Spencer, "Asymptotically optimal covering designs," J. Comb. Theory, A75, 270-280 (1996).
63. D. A. Grable, "Nearly-perfect hypergraph packing is in NC," Inform. Proc. Lett., 60, 295-299 (1997).
64. D. A. Grable and K. T. Phelphs, "Random methods in design theory: A survey," J. Comb. Designs, 4, No. 4, 255-273 (1996).
65. D. A. Grable, "More-than-nearly-perfect packings and partial designs," Combinatorica (in press).
66. C. M. Fortuin, J. Ginibre, and P. N. Kasteleyn, "Correlation inequalities for partially ordered sets," Comm. Math. Phys., 22, 89-103 (1971).
67. M. D. Grigoriadis and L. G. Khachiyan, "Fast approximation schemes for convex programs with many blocks and coupling constraints," SIAM J. Optimiz., 4, 86-107 (1994).
68. 1-ε, " in: Proc. 37th Ann. IEEE Symp. Foundations Computer Science (1996), pp.627-636.
69. J. R. Henderson and R. A. Dean, "A general upper bound for 1-widths," J. Comb. Theory, A18, No. 2, 236-238 (1975).
70. H. A. Kierstead, "On the order dimension of 1-sets versus k-sets," J. Comb. Theory, A73, 219-228 (1996).
71. J. Kahn, "Recent results on some not-so-recent hypergraph matching and covering problems," in: Extremal Problems for Finite Sets, Visegrád, 1991, Bolyai Soc. Math. Studies, 3, 305-353 (1994).
72. J. Kahn, "Coloring nearly-disjoint hypergraphs with n + o(n) colors," J. Comb. Theory, A59, 31-39 (1992).
73. J. Kahn, "A linear programming perspective on the Frankl-Rödl-Pippenger theorem," Random Struct. Algorithms, 8, 149-157 (1996).
74. J. Kahn, "Asymptotically good list-colorings," J. Comb. Theory, A73, 1-59 (1996).
75. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, 4, 373-395 (1984).
76. 2/logt," Random Struct. Algorithms, 7, 173-208 (1995).
77. A.V. Kostochka and V. Rödl, "Partial Steiner systems and matchings in hypergraphs," Random Struct. Algorithms (in press).
78. N. N. Kuzjurin, "On the difference between asymptotically good packings and coverings," European J. Combinatorics, 16, 35-40 (1995).
79. N. N. Kuzjurin, "Locally explicit construction of Rödl's asymptotically good packings," in: Proc. MFCS-98, Brno, Czech Republic, August 1998, Lect. Notes Computer Sci., 1450 (1998), pp.194-202.
80. L. Lovasz, "On the ratio of optimal integral and fractional covers," Discr. Math., 13, 383-390 (1975).
81. M. Luby and N. Nisan, "A parallel approximation algorithm for positive linear programming," in: 25th Proc. ACM Symposium on Theory of Computing (1993), pp.448-457.
82. M. Molloy and B. Reed, "Asymptotically better list colourings," Preprint (1997).
83. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press (1995).
84. M. Naor, L. J. Schulman, and A. Srinivasan, "Splitters and near optimal derandomization," in: Proc. 36th IEEE Symp. Foundations Computer Sci. (1995), pp.182-191.
85. C. H. Papadimitriou and M. Yannakakis, "Linear programming without matrix," in: Proc. ACM Symposium Theory of Computing (1993), pp.121-129.
86. N. Pippenger and J. Spencer, "Asymptotic behavior of the chromatic index for hypergraphs," J. Comb. Theory, A51, 24-42 (1989).
87. S. Plotkin, D. B. Shmoys, and E. Tardos, "Fast approximation algorithms for fractional packings and covering problems," in: Proc. 32nd Annual Symp. IEEE Found. Computer Sci. (1991), pp.495-504.
88. S. Plotkin, D. Shmoys, and E. Tardos, "Fast approximation algorithms for fractional packing and covering problems," in: Technical Report ORIE-999 of the School of Operations Research and Industrial Engineering, Cornell University (1995).
89. J. Radhakrishnan, "Improved bounds for covering complete uniform hypergraphs," Inf. Proc. Lett., 41, 203-207 (1992).
90. P. Raghavan and C. D. Tompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs," Combinatorica, 37, 365-374 (1987).
91. P. Raghavan, "Probabilistic constructions of deterministic algorithms: approximating packing integer programs," J. Comput. Syst. Sci., 37, No. 4, 130-143 (1988).
92. V. Rödl, "On a packing and covering problem," Europ. J. Combinatorics, 5, 69-78 (1985).
93. V. Rödl and L. Thoma, "Asymptotic packing and the random greedy algorithm," Random Structure Algorithms, 8, 161-177 (1996).
94. M. Saks, A. Srinivasan, and S. Zhou, "Explicit dispersers with polylog degree," in: Proc. Ann. 27th Proc. ACM Symp. Theory Computing (1995), pp.479-488.
95. E. R. Scheinerman and D. H. Ullman, Fractional Graph Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization (1997).
96. P. Slavik, "A tight analysis of the greedy algorithm for set cover," J. Algorithms, 25, pp.237-254 (1997).
97. J. H. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia (1987).
98. J. Spencer, "Asymptotic packing via a branching process," Random Structures Algorithms, 7, No. 1, 167-172 (1995).
99. J. Spencer, "Asymptotically good coverings," Pacific J. Math., 118, 575-586 (1985).
100. J. H. Spencer, "Six standard deviations suffice," Trans. Amer. Math. Soc., 289, 679-706 (1985).
101. A. Srinivasan, "Improved approximation guarantees for packing and covering integer programs," in: Proc. ACM Symp. Theory Computing (1995), pp.268-276.
102. A. Srivastav and P. Stangier, "Algorithmic Chernoff-Hoeffding inequalities in integer programming," Random Struct. Algorithms, 8, No. 1, 27-58 (1996).
103. S. K. Stein, "Two combinatorial covering theorems," J. Comb. Theory, A16, No. 3, 391-397 (1974).
104. W. T. Trotter, Combinatorics and Partially Ordered Sets: Dimension Theory, Lecture Series at the Johns Hopkins University (1990).
105. P. Turan, "Egy grafelmeletiszelsoertek feladatrol," Mat. Fiz. Lapok, 48, 436-452 (1941).
106. V. A. Zinoviev, "Cascade equal-weight codes and maximal packings," Problems Contr. Inf. Theory, 12, 3-10 (1983).
107. R. M. Wilson, "An existence theory for pairwise balanced designs," J. Comb. Theory, 13A, 220-273 (1972).
108. R. M. Wilson, "The necessary conditions for t-designs are sufficient for something," Util. Math., 4, 207-215 (1973).
109. R. M. Wilson, "An existence theory for pairwise balanced designs. III. Proof of the existence conjectures," J. Comb. Theory, 18A, 71-79 (1975).