Pages that link to "Item:Q4595963"

The following pages link to Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (Q4595963):

Displaying 33 items.

• Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations (Q73947) (← links)
• Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
• FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
• Online bicriteria algorithms to balance coverage and cost in team formation (Q2039641) (← links)
• Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← 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)
• Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy (Q2091111) (← links)
• An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
• Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
• A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← 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)
• A multi-pass streaming algorithm for regularized submodular maximization (Q2150592) (← links)
• Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint (Q2151371) (← links)
• Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
• Maximizing a monotone non-submodular function under a knapsack constraint (Q2156291) (← links)
• Bicriteria algorithms to balance coverage and cost in team formation under online model (Q2220862) (← links)
• Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
• Improved bounds for the greedy strategy in optimization problems with curvature (Q2424717) (← links)
• A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
• Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid (Q2670444) (← links)
• Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
• On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice (Q2682805) (← links)
• Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
• (Q5002781) (← links)
• An Improved Analysis of Local Search for Max-Sum Diversification (Q5108253) (← links)
• Beyond submodularity: a unified framework of randomized set selection with group fairness constraints (Q6039536) (← links)
• Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)
• On maximizing sums of non-monotone submodular and linear functions (Q6130322) (← links)
• Unified Greedy Approximability beyond Submodular Maximization (Q6141865) (← links)
• Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions (Q6164960) (← links)
• Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint (Q6201343) (← links)