Pages that link to "Item:Q3225171"

The following pages link to Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (Q3225171):

Displaying 50 items.

• Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
• Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
• Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
• Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
• A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
• New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
• Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
• Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
• Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
• An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
• Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
• Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
• Buyback problem with discrete concave valuation functions (Q1751249) (← links)
• Risk averse submodular utility maximization (Q1785423) (← links)
• Approximating graph-constrained max-cut (Q1800989) (← links)
• Robust monotone submodular function maximization (Q1801019) (← links)
• Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
• A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
• Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
• Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
• Adaptive robust submodular optimization and beyond (Q2039658) (← links)
• Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
• Generalized budgeted submodular set function maximization (Q2051778) (← links)
• An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
• Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← 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)
• Private non-monotone submodular maximization (Q2091093) (← links)
• An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
• An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
• Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
• Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
• Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
• Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
• A multi-pass streaming algorithm for regularized submodular maximization (Q2150592) (← links)
• Measured continuous greedy with differential privacy (Q2151374) (← 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)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment (Q2165027) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
• Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
• Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
• Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
• Price of dependence: stochastic submodular maximization with dependent items (Q2292144) (← links)
• Constrained submodular maximization via greedy local search (Q2294252) (← links)