Dependent rounding and its applications to approximation algorithms
From MaRDI portal
Recommendations
Cited in
(55)- On dependent randomized rounding algorithms
- Improved bounds in stochastic matching and optimization
- Online stochastic matching: new algorithms and bounds
- Scheduling to minimize energy and flow time in broadcast scheduling
- An almost optimal approximation algorithm for monotone submodular multiple knapsack
- Iterative partial rounding for vertex cover with hard capacities
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- An adaptive routing approach for personal rapid transit
- A PTAS for the cardinality constrained covering with unit balls
- Randomized rounding in the presence of a cardinality constraint
- Approximation algorithms for stochastic combinatorial optimization problems
- An approximation algorithm for uniform capacitated k-median problem with 1+ capacity violation
- Improved approximation algorithms for stochastic matching
- Improved approximation algorithm for fault-tolerant facility placement
- Approximating the Interval Constrained Coloring Problem
- Component-by-component construction of low-discrepancy point sets of small size
- Randomized rounding for routing and covering problems: experiments and improvements
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Geometric rounding: A dependent randomized rounding scheme
- scientific article; zbMATH DE number 2079377 (Why is no real title available?)
- A new approximation technique for resource-allocation problems
- Random walks in polytopes and negative dependence
- scientific article; zbMATH DE number 910872 (Why is no real title available?)
- Proportional approval voting, harmonic \(k\)-median, and negative association
- The interval constrained 3-coloring problem
- Semi-online bipartite matching
- An improved derandomized approximation algorithm for the max-controlled set problem
- Dependent Randomized Rounding: The Bipartite Case
- Congestion minimization for multipath routing via multiroute flows
- Capacitated domination problem
- Capacitated Domination Problem
- The entropy rounding method in approximation algorithms
- Approximation algorithms for clustering with dynamic points
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
- Capacitated discrete unit disk cover
- An Experimental Study of Algorithms for Online Bipartite Matching
- Resource time-sharing for IoT applications with deadlines
- Tight approximation algorithms for ordered covering
- Approximation algorithms for the interval constrained coloring problem
- Into the unknown: assigning reviewers to papers with uncertain affinities
- Two-sided capacitated submodular maximization in gig platforms
- Time-sharing scheduling with tolerance capacities
- Concentration of submodular functions and read-k families under negative dependence
- Online bipartite matching in the probe-commit model
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Drawing a map of elections
- Combinatorial multi-armed bandits with fairness constraints: an online convex optimization perspective
- Approximation algorithms for maximum weighted throughput on unrelated machines
- Optimal algorithms for multiwinner elections and the Chamberlin-Courant rule
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- Assortment optimization with visibility constraints
- Candidate monotonicity and proportionality for lotteries and non-resolute rules
- Approximation algorithms for k-submodular maximization under fairness constraints and size constraints
- On the configuration LP for maximum budgeted allocation
This page was built for publication: Dependent rounding and its applications to approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546323)
