The following pages link to M. I. Sviridenko (Q208494):
Displayed 50 items.
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints (Q3058545) (← links)
- (Q3115718) (← links)
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem (Q3117702) (← links)
- The diameter of a long-range percolation graph (Q3150196) (← links)
- New and Improved Bounds for the Minimum Set Cover Problem (Q3167404) (← links)
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities (Q3168976) (← links)
- On the Maximum Quadratic Assignment Problem (Q3169070) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Sum edge coloring of multigraphs via configuration LP (Q3189004) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- Bundle Pricing with Comparable Items (Q3527236) (← links)
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs (Q3546300) (← links)
- (Q3579387) (← links)
- Improved approximation algorithms for broadcast scheduling (Q3581494) (← links)
- Tight approximation algorithms for maximum general assignment problems (Q3581502) (← links)
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing (Q3586179) (← links)
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (Q3587410) (← links)
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem (Q3595394) (← links)
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times (Q3595396) (← links)
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times (Q3596345) (← links)
- Improved Approximation Algorithms for Broadcast Scheduling (Q3631906) (← links)
- On Hardness of Pricing Items for Single-Minded Bidders (Q3638879) (← links)
- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability (Q3652193) (← links)
- (Q4242386) (← links)
- (Q4242567) (← links)
- (Q4263699) (← links)
- (Q4400857) (← links)
- (Q4428906) (← links)
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme (Q4443085) (← links)
- A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP (Q4443134) (← links)
- (Q4471354) (← links)
- (Q4501555) (← links)
- (Q4527196) (← links)
- (Q4537755) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q4554944) (← links)
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature (Q4595963) (← links)
- Solving Optimization Problems with Diseconomies of Scale via Decoupling (Q4625663) (← links)
- (Q4633862) (← links)
- A Bi-Criteria Approximation Algorithm for k-Means (Q4636444) (← links)
- Buffer Overflow Management in QoS Switches (Q4651481) (← links)
- (Q4737531) (← links)
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective (Q4806607) (← links)
- (Q4828951) (← links)
- An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem (Q4910826) (← links)
- Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines (Q4911539) (← links)
- (Q4941835) (← links)
- (Q4952712) (← links)