Pages that link to "Item:Q2010096"

The following pages link to Parametric monotone function maximization with matroid constraints (Q2010096):

Displaying 25 items.

• Online bicriteria algorithms to balance coverage and cost in team formation (Q2039641) (← links)
• Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
• Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
• Bicriteria streaming algorithms to balance gain and cost with cardinality constraint (Q2084653) (← links)
• Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
• The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
• An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
• Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
• On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint (Q2149857) (← links)
• A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions (Q2149859) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
• Bicriteria algorithms to balance coverage and cost in team formation under online model (Q2220862) (← links)
• Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← links)
• Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint (Q5024901) (← links)
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5918257) (← links)
• Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331) (← links)
• Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)
• Improved algorithms for non-submodular function maximization problem (Q5918732) (← links)
• Fast algorithms for maximizing monotone nonsubmodular functions (Q5918746) (← links)
• Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)
• Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5925506) (← links)
• Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice (Q6542993) (← links)
• Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966) (← links)
• Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions (Q6610086) (← links)