Pages that link to "Item:Q3964292"
From MaRDI portal
The following pages link to Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems (Q3964292):
Displaying 48 items.
- Competitive facility location and design problem (Q879283) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
- A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658) (← links)
- Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (Q1577475) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- An analysis of the greedy algorithm for the submodular set covering problem (Q1838034) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints (Q2087465) (← links)
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Dual domination problems in graphs (Q2136849) (← links)
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
- Streaming algorithms for maximizing DR-submodular functions with \(d\)-knapsack constraints (Q2151370) (← links)
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint (Q2670465) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Streaming submodular maximization under \(d\)-knapsack constraints (Q2682804) (← links)
- On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice (Q2682805) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline (Q2947023) (← links)
- Scenario Submodular Cover (Q2971162) (← links)
- Maximizing set function formulation of two scheduling problems (Q4015963) (← links)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5002614) (← links)
- Non-Submodular Maximization with Matroid and Knapsack Constraints (Q5024472) (← links)
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model (Q5028360) (← links)
- (Q5053276) (← links)
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q5925509) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752) (← links)