The following pages link to M. I. Sviridenko (Q208494):
Displayed 36 items.
- Inapproximability of the Multilevel Uncapacitated Facility Location Problem (Q4962635) (← links)
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs (Q4962739) (← links)
- (Q4999097) (← links)
- (Q5002622) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
- Supermodularity and Affine Policies in Dynamic Robust Optimization (Q5166259) (← links)
- Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms (Q5166263) (← links)
- Non-monotone submodular maximization under matroid and knapsack constraints (Q5172726) (← links)
- Buffer overflow management in QoS switches (Q5176010) (← links)
- Online server allocation in a server farm via benefit task systems (Q5176012) (← links)
- An Algorithm for Online K-Means Clustering (Q5232548) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- On the rate of convergence to the neutral attractor of a family of one-dimensional maps (Q5306808) (← links)
- Large Neighborhood Local Search for the Maximum Set Packing Problem (Q5326611) (← links)
- New Approximations for Broadcast Scheduling via Variants of α-point Rounding (Q5362999) (← links)
- Minimizing Makespan in No-Wait Job Shops (Q5387950) (← links)
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes (Q5387964) (← links)
- Job Shop Scheduling with Unit Processing Times (Q5387985) (← links)
- Algorithms and Data Structures (Q5394263) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5405073) (← links)
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities (Q5429286) (← links)
- Automata, Languages and Programming (Q5466461) (← links)
- (Q5501259) (← links)
- (Q5501361) (← links)
- Experimental and Efficient Algorithms (Q5710038) (← links)
- (Q5743409) (← links)
- Concentration and Moment Inequalities for Polynomials of Independent Random Variables (Q5743410) (← links)
- (Q5743432) (← links)
- Submodular Optimization with Contention Resolution Extensions. (Q5875454) (← links)
- Tight Bounds for Permutation Flow Shop Scheduling (Q5895000) (← links)
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5895002) (← links)
- Tight Bounds for Permutation Flow Shop Scheduling (Q5900092) (← links)
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5902164) (← links)
- Best possible approximation algorithm for MAX SAT with cardinality constraint. (Q5945919) (← links)
- Bernstein-like Concentration and Moment Inequalities for Polynomials of Independent Random Variables: Multilinear Case (Q6227941) (← links)
- Optimization Problems with Diseconomies of Scale via Decoupling (Q6250690) (← links)