Abstract
A class of set covering problems is being introduced. This class is obtained from reformulation of a well-known combinatorial problem of Erdös on the hypercube. An algorithmic method of solution to the problem is proposed. Max-flow algorithms are the main ingredients of our method.
The computational results which will be presented here, improves the best existing bound related to the combinatorial problem. This, at the same time, provides a good approximate solution to the corresponding set covering problem of more than a thousand variables and constraints.
Moreover, we show that our special class of problems can be recognized from the class of all set covering problems, by a polynomial algorithm with O (MN) complexity, where M and N are numbers of constraints and variables of a given instant, respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, “Some valid inequalities for the set partitioning problem, in studies in Integer Programming,” Annual of Discrete Mathematics, vol. 1, 1977.
E.Balas and S.-M.Ng, “On the Set-Covering polytope: I. All the facets with coefficients in (0, 1, 2),” Report No. MSRR 522 Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, 1985.
B. Becker and H.U. Simon, “How Robust in the n-cube?” IEEE 27th Annual Symposium on Foundations of Computer Science, pp. 283–291, 1986.
J.A.Bondy and U.S.R.Murty, Graph Theory with Applications, North-Holland, N.Y., Amsterdam-Oxford, 1976.
I.J. Dejter and P. Guan, “Square-blocking edge subsets and vertex avoidance in hypercubes,” to appear.
M.R.Emamy-K. I.J.Dejter, and P.Guan, “On the fault tolerance of the 5-cube,” Congressus Numerantum, vol. 80, pp. 171–176, 1991.
M.R. Emamy-K., P. Guan, and P. Rivera, “On the characterization of the maximum squareless subgraphs of 5-cube,” to appear in Congressus Numerantium, 1992.
P.Erdös, “Problems and results in Combinatorial Analysis and Combinatorial Number Theory,” to appear in Y.Alavi (Ed.) Proceedings of the Sixth Int. Conf. Graph Theory, Kalamazoo, Michigan, J. Wiley, 1988.
S. Even, Graph Algorithm, Computer Science Press, 1979.
P. Guan, “A lower bound for the maximum square free subset of edges in a hypercube,” 2th Conference of Combinatorics, Graph Theory and Computing, Boca Ratón, Feb. 1990.
K.A. Johnson, “Some results on Buds, stems and fault tolerance in hypercubes of dimension ≤5,“ to appear.
M. Livingston, Q. Stout, N. Graham, and F. Harary, “Subcube Fault-tolerance in hypercubes,” Technical Report CRT-TR-12-87, Computing Laboratory, University of Michigan, 1987.
Uri N.Peled and B.Simeone, “Polynomial-Time Algorithms for regular set covering and threshold synthesis,” Discrete Applied Mathematics, vol. 12, pp. 57–69, 1985.
A. Ramírez, M.S. Thesis, University of Puerto Rico, Mathematics Department, Río Piedras, Puerto Rico, 1990.
Author information
Authors and Affiliations
Additional information
This research is supported by EPSCOR-NSF of Puerto Rico and by FIPI, the institutional grant of University of Puerto Rico.
Rights and permissions
About this article
Cite this article
Emamy-K, M.R., Ramírez, A.I. A special class of set covering problems. Comput Optim Applic 5, 79–88 (1996). https://doi.org/10.1007/BF00429752
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00429752