Pages that link to "Item:Q3634201"

The following pages link to ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201):

Displaying 10 items.

• New dominating sets in social networks (Q604953) (← links)
• Buyback problem with discrete concave valuation functions (Q1751249) (← links)
• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
• Matroid rank functions and discrete concavity (Q1926653) (← links)
• Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
• The Finite Matroid-Based Valuation Conjecture is False (Q4959128) (← links)
• (Q5002781) (← links)
• Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)