Approximating maximum independent sets in uniform hypergraphs
Authors:
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 562-570
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Approximating the independence number via theϑ-functionMathematical Programming, 1998
- An algorithm for 3-colorable graphsInformation Processing Letters, 1997
- Greed is good1994
- An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed SizeSIAM Journal on Discrete Mathematics, 1993
- A still better performance guarantee for approximate graph coloringInformation Processing Letters, 1993
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3Information Processing Letters, 1992
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- On the parallel complexity of computing a maximal independent set in a hypergraph1992
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Combinatorial Theorems on Classifications of Subsets of a Given SetProceedings of the London Mathematical Society, 1952