An Exact Characterization of Greedy Structures
From MaRDI portal
Publication:4695388
Recommendations
Cited in
(23)- The application of automated reasoning to formal models of combinatorial optimization
- Phylogenetic footprinting and consistent sets of local aligments
- On \(b\)-bistochastic quadratic stochastic operators
- scientific article; zbMATH DE number 4191657 (Why is no real title available?)
- A new greedy algorithm for the quadratic assignment problem
- A framework for the greedy algorithm
- On the Greedy Solution of Ordering Problems
- Recognizing Greedy Structures
- On ordered languages and the optimization of linear functions by greedy algorithms
- On the Structure of Optimal Greedy Computation (for Job Scheduling)
- Some recent results in the analysis of greedy algorithms for assignment problems
- A greedy algorithm for interval greedoids
- On stable \(b\)-bistochastic quadratic stochastic operators and associated non-homogenous Markov chains
- The \(S\)-digraph optimization problem and the greedy algorithm
- A greedy algorithm for some classes of integer programs.
- New polyhedral and algorithmic results on greedoids
- A general model for matroids and the greedy algorithm
- On the generality of the greedy algorithm for solving matroid base problems
- A class of greedy algorithms and its relation to greedoids
- scientific article; zbMATH DE number 4137538 (Why is no real title available?)
- Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators
- Problems on independence systems solvable by the greedy algorithm
- scientific article; zbMATH DE number 3904604 (Why is no real title available?)
This page was built for publication: An Exact Characterization of Greedy Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695388)