The following pages link to (Q3549686):
Displaying 50 items.
- 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)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Energy efficient monitoring in sensor networks (Q627527) (← links)
- Natural graph wavelet packet dictionaries (Q829903) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
- Non-submodular streaming maximization with minimum memory and low adaptive complexity (Q2039664) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice (Q2089671) (← 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)
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice (Q2150564) (← links)
- Measured continuous greedy with differential privacy (Q2151374) (← links)
- Policies for risk-aware sensor data collection by mobile agents (Q2151909) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Approximation algorithms for the partial assignment problem (Q2197546) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- Welfare maximization with production costs: a primal dual approach (Q2278952) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Submodular functions: from discrete to continuous domains (Q2414912) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Limitations of randomized mechanisms for combinatorial auctions (Q2516249) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- A mobile multi-agent sensing problem with submodular functions under a partition matroid (Q2668714) (← links)
- The multi-budget maximum weighted coverage problem (Q2692723) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- Optimal bounds on approximation of submodular and XOS functions by juntas (Q2816303) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- Single-Parameter Combinatorial Auctions with Partially Public Valuations (Q3162522) (← links)
- Solving packing integer programs via randomized rounding with alterations (Q3191563) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- (Q4558139) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- (Q4969174) (← links)
