An Exact Characterization of Greedy Structures
DOI10.1137/0406021zbMATH Open0798.68061DBLPjournals/siamdm/HelmanMS93OpenAlexW2052400935WikidataQ55954627 ScholiaQ55954627MaRDI QIDQ4695388FDOQ4695388
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
Publication date: 21 July 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0406021
greedy algorithmmatroidgreedoidset systemlinear objective functionbottleneck objective functionalgorithmic paradigmmatroid embedding
Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Parallel algorithms in computer science (68W10)
Cited In (15)
- The application of automated reasoning to formal models of combinatorial optimization
- On \(b\)-bistochastic quadratic stochastic operators
- A new greedy algorithm for the quadratic assignment problem
- On the Greedy Solution of Ordering Problems
- A framework for the greedy algorithm
- Recognizing Greedy Structures
- Phylogenetic Footprinting and Consistent Sets of Local Aligments
- 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
- A greedy algorithm for some classes of integer programs.
- New polyhedral and algorithmic results on greedoids
- Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators
- Problems on independence systems solvable by the greedy algorithm
- On stable b-bistochastic quadratic stochastic operators and associated non-homogenous Markov chains
Recommendations
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)
