Pages that link to "Item:Q790044"

The following pages link to Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044):

Displaying 1 item.

• Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)