On the greedy algorithm with random costs

DOI10.1007/BF02592060zbMath0616.90057OpenAlexW1995407307MaRDI QIDQ4726053

Colin J. H. McDiarmid

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592060

zbMATH Keywords

greedy algorithmprobabilistic analysismatroidsbranchingbalancedhereditary systems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

On linear programs with random costs ⋮ On random minimum length spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• On the value of a random minimum spanning tree problem
• On linear programs with random costs
• Closure in Independence Systems
• THRESHOLD FUNCTIONS FOR SOME PROPERTIES OF RANDOM SUBSETS OF PROJECTIVE SPACES
• General first-passage percolation

This page was built for publication: On the greedy algorithm with random costs