The following pages link to M. I. Sviridenko (Q208494):
Displaying 50 items.
- (Q329298) (redirect page) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- A note on permutation flow shop problem (Q596465) (← links)
- (Q628307) (redirect page) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- A note on the Kenyon-Remila strip-packing algorithm (Q763478) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks (Q880554) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective: A correction (Q880571) (← links)
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
- An 0. 828-approximation algorithm for the uncapacitated facility location problem (Q1296569) (← links)
- A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658) (← links)
- Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (Q1577475) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Energy-efficient scheduling and routing via randomized rounding (Q1617291) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems (Q1882632) (← links)
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee (Q1888170) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Two-dimensional bin packing with one-dimensional resource augmentation (Q2467124) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- Hamiltonian completions of sparse random graphs (Q2576345) (← links)
- A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts (Q2719167) (← links)
- (Q2753724) (← links)
- (Q2753920) (← links)
- No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373) (← links)
- Makespan minimization in job shops (Q2819572) (← links)
- Matroid Matching: The Power of Local Search (Q2839182) (← links)
- A Harmonic Algorithm for the 3D Strip Packing Problem (Q2840983) (← links)
- Matroid matching (Q2875164) (← links)
- Tight Approximation Algorithms for Maximum Separable Assignment Problems (Q2884281) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2904785) (← links)
- Polynomial-Time Approximation Schemes for Circle Packing Problems (Q2921456) (← links)
- (Q2921672) (← links)
- Approximating the minimum quadratic assignment problems (Q2930294) (← links)
- Dynamic pricing for impatient bidders (Q2930314) (← links)
- The Santa Claus problem (Q2931367) (← links)
- (Q2934659) (← links)
- (Q2934715) (← links)
- Bidding Strategies for Fantasy-Sports Auctions (Q2959822) (← links)
- (Q2963934) (← links)
- Submodular Stochastic Probing on Matroids (Q2965469) (← links)
- Stochastic Scheduling on Unrelated Machines (Q2965523) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems (Q3046502) (← links)
