Pages that link to "Item:Q3449564"

The following pages link to A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564):

Displaying 43 items.

• On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
• Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
• Greedy differencing edge-contraction heuristic for the max-cut problem (Q2060537) (← links)
• The submodularity of two-stage stochastic maximum-weight independent set problems (Q2089673) (← links)
• Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
• Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
• A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice (Q2175059) (← links)
• Target users' activation probability maximization with different seed set constraints in social networks (Q2197539) (← links)
• A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
• Local search algorithms for the maximum carpool matching problem (Q2205630) (← links)
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
• On additive approximate submodularity (Q2672599) (← links)
• Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
• (Q2958605) (← links)
• A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions (Q3297828) (← links)
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
• (Q4969174) (← links)
• (Q4969210) (← links)
• Online Submodular Maximization with Preemption (Q4972676) (← links)
• (Q5005131) (← links)
• <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
• Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
• Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
• Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
• (Q5090928) (← links)
• Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
• Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
• (Q5111744) (← links)
• Monotone submodular maximization over the bounded integer lattice with cardinality constraints (Q5207510) (← links)
• A fast double greedy algorithm for non-monotone DR-submodular function maximization (Q5216445) (← links)
• Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds (Q5269825) (← links)
• Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
• Improved Randomized Algorithm for <i>k</i>-Submodular Function Maximization (Q5855531) (← links)
• Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)
• Coreness of cooperative games with truncated submodular profit functions (Q5915546) (← links)
• Sequence submodular maximization meets streaming (Q5918267) (← links)
• Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331) (← links)
• Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)
• Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
• A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity (Q6118307) (← links)
• Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid (Q6170425) (← links)
• An exact solution approach for the mobile multi‐agent sensing problem (Q6194842) (← links)