An Exact Characterization of Greedy Structures

DOI10.1137/0406021zbMath0798.68061OpenAlexW2052400935WikidataQ55954627 ScholiaQ55954627MaRDI QIDQ4695388

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

zbMATH Keywords

greedy algorithmmatroidset systemgreedoidlinear objective functionbottleneck objective functionalgorithmic paradigmmatroid embedding

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

On \(b\)-bistochastic quadratic stochastic operators ⋮ On the Structure of Optimal Greedy Computation (for Job Scheduling) ⋮ A greedy algorithm for interval greedoids ⋮ Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators ⋮ Problems on independence systems solvable by the greedy algorithm ⋮ A new greedy algorithm for the quadratic assignment problem ⋮ A greedy algorithm for some classes of integer programs. ⋮ New polyhedral and algorithmic results on greedoids ⋮ On stable b-bistochastic quadratic stochastic operators and associated non-homogenous Markov chains ⋮ Phylogenetic Footprinting and Consistent Sets of Local Aligments ⋮ The application of automated reasoning to formal models of combinatorial optimization ⋮ Some recent results in the analysis of greedy algorithms for assignment problems

This page was built for publication: An Exact Characterization of Greedy Structures