Pages that link to "Item:Q4178796"
From MaRDI portal
The following pages link to Best Algorithms for Approximating the Maximum of a Submodular Set Function (Q4178796):
Displaying 50 items.
- Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations (Q73947) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- Some comments on the Slater number (Q526227) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Sensor networks: from dependence analysis via matroid bases to online synthesis (Q742408) (← links)
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344) (← links)
- The leader-follower location model (Q883197) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Local optimization on graphs (Q1122503) (← links)
- Lower bounds on the worst-case complexity of some oracle algorithms (Q1251896) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- Dividing and conquering the square (Q1801677) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- An optimization approach to plan for reusable software components (Q1847245) (← links)
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Learning diffusion on global graph: a PDE-directed approach for feature detection on geometric shapes (Q2010320) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Private non-monotone submodular maximization (Q2091093) (← links)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint (Q2097487) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Adaptive seeding for profit maximization in social networks (Q2114590) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- Ranking with submodular functions on a budget (Q2147409) (← links)
- Bi-criteria adaptive algorithms for minimizing supermodular functions with cardinality constraint (Q2151371) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Viral marketing of online game by DS decomposition in social networks (Q2282998) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
- Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- The matroid intersection cover problem (Q2661583) (← links)
- Stochastic-lazier-greedy algorithm for monotone non-submodular maximization (Q2666680) (← links)
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences (Q2681004) (← links)
- Streaming submodular maximization under \(d\)-knapsack constraints (Q2682804) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- Hub Location as the Minimization of a Supermodular Set Function (Q2935299) (← links)
