Pages that link to "Item:Q3546323"
From MaRDI portal
The following pages link to Dependent rounding and its applications to approximation algorithms (Q3546323):
Displayed 37 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- The interval constrained 3-coloring problem (Q500992) (← links)
- Capacitated domination problem (Q534769) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding (Q708312) (← links)
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- Online stochastic matching: new algorithms and bounds (Q2006938) (← links)
- Scheduling to minimize energy and flow time in broadcast scheduling (Q2018933) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- An adaptive routing approach for personal rapid transit (Q2392823) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) (← links)
- Improved Approximation Algorithms for Stochastic Matching (Q3452763) (← links)
- Improved Approximation Algorithm for Fault-Tolerant Facility Placement (Q3453283) (← links)
- Approximating the Interval Constrained Coloring Problem (Q3512460) (← links)
- Component-by-component construction of low-discrepancy point sets of small size (Q3516786) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Proportional Approval Voting, Harmonic k-median, and Negative Association (Q5002696) (← links)
- (Q5090428) (← links)
- An improved derandomized approximation algorithm for the max-controlled set problem (Q5198931) (← links)
- (Q5240417) (← links)
- Capacitated Domination Problem (Q5387762) (← links)
- (Q5743405) (← links)
- (Q5874506) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Capacitated discrete unit disk cover (Q5918931) (← links)
- An Experimental Study of Algorithms for Online Bipartite Matching (Q6039931) (← links)
- Resource time-sharing for IoT applications with deadlines (Q6112000) (← links)