scientific article; zbMATH DE number 4149905
From MaRDI portal
Publication:3479822
zbMATH Open0701.90078MaRDI QIDQ3479822FDOQ3479822
Publication date: 1990
Title of this publication is not available (Why is that?)
Permutations, words, matrices (05A05) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (3)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem π π
- A note on greedy algorithms for the maximum weighted independent set problem π π
- A note on the random greedy independent set algorithm π π
- Problems on independence systems solvable by the greedy algorithm π π
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set π π
- The greedier the better: an efficient algorithm for approximating maximum independent set π π
- Greedy approximations of independent sets in low degree graphs π π
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth π π
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479822)