Pages that link to "Item:Q489121"

The following pages link to Simultaneous approximation of multi-criteria submodular function maximization (Q489121):

Displaying 9 items.

• Online bicriteria algorithms to balance coverage and cost in team formation (Q2039641) (← links)
• Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
• Bicriteria streaming algorithms to balance gain and cost with cardinality constraint (Q2084653) (← links)
• On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint (Q2149857) (← links)
• A constrained two-stage submodular maximization (Q2220851) (← links)
• Bicriteria algorithms to balance coverage and cost in team formation under online model (Q2220862) (← links)
• Non-submodular maximization on massive data streams (Q2307748) (← links)
• Sequence submodular maximization meets streaming (Q5918267) (← links)
• Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)