Pages that link to "Item:Q5169688"

The following pages link to Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (Q5169688):

Displayed 6 items.

• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) ‎ (← links)
• New performance guarantees for the greedy maximization of submodular set functions (Q523157) ‎ (← links)
• The knapsack problem with neighbour constraints (Q1932367) ‎ (← links)
• (Q2958605) ‎ (← links)
• Streaming Algorithms for Submodular Function Maximization (Q3448795) ‎ (← links)
• Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) ‎ (← links)