The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms
- 1 May 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (2) , 329-346
- https://doi.org/10.1137/0212021
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- The number of increasing subsequences of the random permutationJournal of Combinatorial Theory, Series A, 1981
- Hard Knapsack ProblemsOperations Research, 1980
- A note on some computationally difficult set covering problemsMathematical Programming, 1980
- The efficiency of an algorithm of integer programming: a probabilistic analysisProceedings of the American Mathematical Society, 1980
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systemsPublished by Springer Nature ,1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On cliques in graphsIsrael Journal of Mathematics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965