Pages that link to "Item:Q1888170"
From MaRDI portal
The following pages link to Pipage rounding: a new method of constructing algorithms with proven performance guarantee (Q1888170):
Displayed 50 items.
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- Video distribution under multiple constraints (Q551203) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- An accelerated continuous greedy algorithm for maximizing strong submodular functions (Q887854) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Packing under convex quadratic constraints (Q2118134) (← 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)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- The approximability of multiple facility location on directed networks with random arc failures (Q2196606) (← links)
- An efficient linear programming based method for the influence maximization problem in social networks (Q2224940) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint (Q2235731) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
- Price of dependence: stochastic submodular maximization with dependent items (Q2292144) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- Adding cardinality constraints to integer programs with applications to maximum satisfiability (Q2380072) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- A comment on scheduling two parallel machines with capacity constraints (Q2581321) (← links)
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice (Q2679235) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
- Submodularity and Randomized rounding techniques for Optimal Experimental Design (Q2883636) (← links)
- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline (Q2947023) (← links)
- Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design (Q2959848) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)
- On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models (Q4637075) (← links)
- (Q5009574) (← links)
- Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)
- Fairness in Influence Maximization through Randomization (Q5076357) (← links)
- Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
- (Q5091209) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- (Q5743409) (← links)
- Fast algorithms for maximizing monotone nonsubmodular functions (Q5918332) (← links)