Neighbor systems and the greedy algorithm

DOI10.1137/090777463MaRDI QIDQ3013153zbMATH OpenOpenAlexFDO

Authors David Hartvigsen

Publication date 18 July 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/090777463

zbMATH Keywords

greedy algorithmjump systemsmatroids

Mathematics Subject Classification ID

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

Recommendations

• Neighbor systems and the greedy algorithm. (Extended abstract).
• Neighbor systems, jump systems, and bisubmodular polyhedra
• Neighbor systems, jump systems, and bisubmodular polyhedra
• scientific article; zbMATH DE number 169611
• A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM

Cited in

(4)

• Neighbor systems and the greedy algorithm. (Extended abstract).
• Neighbor systems, jump systems, and bisubmodular polyhedra
• Neighbor systems, jump systems, and bisubmodular polyhedra
• Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids

This page was built for publication: Neighbor systems and the greedy algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013153)