The following pages link to (Q4196269):
Displaying 50 items.
- Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations (Q73947) (← links)
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Is submodularity testable? (Q472463) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- Maximizing a submodular function with viability constraints (Q513299) (← links)
- New performance guarantees for the greedy maximization of submodular set functions (Q523157) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- Video distribution under multiple constraints (Q551203) (← links)
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
- Logical processing for integer programming (Q817209) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems (Q900693) (← links)
- Randomized priority algorithms (Q974749) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
- A constructive proof of swap local search worst-case instances for the maximum coverage problem (Q1790189) (← links)
- Maximizing monotone submodular functions over the integer lattice (Q1801020) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Multi-pass streaming algorithms for monotone submodular function maximization (Q2075395) (← links)
- Who should get vaccinated? Individualized allocation of vaccines over SIR network (Q2106396) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- A multi-pass streaming algorithm for regularized submodular maximization (Q2150592) (← links)
- Policies for risk-aware sensor data collection by mobile agents (Q2151909) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems (Q2166001) (← links)
- Quality of local equilibria in discrete exchange economies (Q2178594) (← links)
- Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees (Q2184512) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time (Q2216441) (← links)
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
- Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)
- Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions (Q2280688) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint (Q2300732) (← links)
- Set function optimization (Q2314057) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
