scientific article; zbMATH DE number 169611

zbMATH Open0787.90070MaRDI QIDQ4038320FDOQ4038320

Authors: Stefano Alliney 

Publication date: 16 May 1993

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

Recommendations

• scientific article; zbMATH DE number 4149905
• A framework for the greedy algorithm
• scientific article; zbMATH DE number 3904604
• A greedy algorithm for maximizing a linear objective function
• Greedy Families for Linear Objective Functions

zbMATH Keywords

greedy algorithmmatroidsgreedoidsdefective independence systemsdefective reduction systemsmaximum weight admissible set

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (20)

• Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid
• Weakly greedy algorithm and pair-Delta-matroids
• Greedy in Approximation Algorithms
• A generalization of the notion of the rank function of a matroid
• A greedy algorithm for interval greedoids
• Neighbor systems and the greedy algorithm
• Hereditary systems and greedy-type algorithms.
• Greedy algorithm compatibility and heavy-set structures
• Title not available (Why is that?)
• When the greedy algorithm fails
• The greedy algorithm as a combinatorial principle
• On performance of greedy algorithms
• Title not available (Why is that?)
• On the generality of the greedy algorithm for solving matroid base problems
• Greedy algorithm with gaps
• Matroidal approximations of independence systems
• Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
• A greedy algorithm for maximizing a linear objective function
• Problems on independence systems solvable by the greedy algorithm
• An Exact Characterization of Greedy Structures

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