scientific article; zbMATH DE number 4149905

zbMATH Open0701.90078MaRDI QIDQ3479822FDOQ3479822

Authors: Stefano Alliney 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 20942
• Problems on independence systems solvable by the greedy algorithm
• A note on the random greedy independent set algorithm
• Publication:4938679
• The greedier the better: an efficient algorithm for approximating maximum independent set
• GreedyMAX-type algorithms for the maximum independent set problem
• Greedy approximations of independent sets in low degree graphs
• A note on greedy algorithms for the maximum weighted independent set problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth

zbMATH Keywords

greedy algorithmDefective independence systemsworst-case estimate

Mathematics Subject Classification ID

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 (7)

• Weakly greedy algorithm and pair-Delta-matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• When the greedy algorithm fails
• Matroidal approximations of independence systems
• Title not available (Why is that?)

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)