Efficient bounds for the stable set, vertex cover and set packing problems
- 1 September 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 6 (3) , 243-254
- https://doi.org/10.1016/0166-218x(83)90080-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- Every planar map is four colorable. Part II: ReducibilityIllinois Journal of Mathematics, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Three short proofs in graph theoryJournal of Combinatorial Theory, Series B, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941