default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxim Sviridenko
Person information
- affiliation: IBM Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c84]Kyriakos Axiotis, Maxim Sviridenko:
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. ICML 2023: 1302-1319- [i23]Kyriakos Axiotis, Maxim Sviridenko:
Gradient Descent Converges Linearly for Logistic Regression on Separable Data. CoRR abs/2306.14381 (2023) - 2022
- [c83]Kyriakos Axiotis, Maxim Sviridenko:
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. ICML 2022: 1175-1197 - [i22]Kyriakos Axiotis, Maxim Sviridenko:
Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime. CoRR abs/2204.08274 (2022) - 2021
- [j68]Kyriakos Axiotis, Maxim Sviridenko:
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. J. Mach. Learn. Res. 22: 122:1-122:47 (2021) - [c82]Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko:
TSI: An Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity. CIKM 2021: 4036-4045 - [c81]Kyriakos Axiotis, Maxim Sviridenko:
Local Search Algorithms for Rank-Constrained Convex Optimization. ICLR 2021 - [c80]Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava
, Maxim Sviridenko:
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search. KDD 2021: 3404-3413 - [i21]Kyriakos Axiotis, Maxim Sviridenko:
Local Search Algorithms for Rank-Constrained Convex Optimization. CoRR abs/2101.06262 (2021) - [i20]Shaunak Mishra, Mikhail Kuznetsov, Gaurav Srivastava, Maxim Sviridenko:
VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search. CoRR abs/2108.02725 (2021) - [i19]Shaunak Mishra, Changwei Hu, Manisha Verma, Kevin Yen, Yifan Hu, Maxim Sviridenko:
TSI: an Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity. CoRR abs/2108.08226 (2021) - 2020
- [c79]Kyriakos Axiotis, Maxim Sviridenko:
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. ICML 2020: 452-462 - [i18]Kyriakos Axiotis, Maxim Sviridenko:
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding. CoRR abs/2006.14571 (2020)
2010 – 2019
- 2019
- [c78]Benjamin Moseley, Maxim Sviridenko:
Submodular Optimization with Contention Resolution Extensions. APPROX-RANDOM 2019: 3:1-3:17 - [i17]Róbert Busa-Fekete, Krzysztof Dembczynski, Alexander Golovnev, Kalina Jasinska, Mikhail Kuznetsov, Maxim Sviridenko, Chao Xu:
On the computational complexity of the probabilistic label tree algorithms. CoRR abs/1906.00294 (2019) - 2018
- [j67]Lehilton L. C. Pedrosa, Maxim Sviridenko:
Integrated Supply Chain Management via Randomized Rounding. INFORMS J. Comput. 30(1): 124-136 (2018) - [j66]Konstantin Makarychev, Maxim Sviridenko:
Solving Optimization Problems with Diseconomies of Scale via Decoupling. J. ACM 65(6): 42:1-42:27 (2018) - [j65]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy-efficient scheduling and routing via randomized rounding. J. Sched. 21(1): 35-51 (2018) - [c77]Ruggiero Cavallo, Maxim Sviridenko, Christopher A. Wilkens:
Matching Auctions for Search and Native Ads. EC 2018: 663-680 - 2017
- [j64]Maxim Sviridenko, Jan Vondrák, Justin Ward:
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature. Math. Oper. Res. 42(4): 1197-1218 (2017) - [j63]Konstantin Makarychev, Maxim Sviridenko:
Maximizing Polynomials Subject to Assignment Constraints. ACM Trans. Algorithms 13(4): 54:1-54:15 (2017) - [c76]Christopher Musco, Maxim Sviridenko, Justin Thaler:
Determining Tournament Payout Structures for Daily Fantasy Sports. ALENEX 2017: 172-184 - [c75]Edo Liberty, Maxim Sviridenko:
Greedy Minimization of Weakly Supermodular Set Functions. APPROX-RANDOM 2017: 19:1-19:11 - [c74]Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens:
Sponsored Search Auctions with Rich Ads. WWW 2017: 43-51 - [i16]Ruggiero Cavallo, Prabhakar Krishnamurthy, Maxim Sviridenko, Christopher A. Wilkens:
Sponsored Search Auctions with Rich Ads. CoRR abs/1701.05948 (2017) - 2016
- [j62]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica 76(2): 536-568 (2016) - [j61]Marcin Mucha, Maxim Sviridenko:
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. Math. Oper. Res. 41(1): 247-254 (2016) - [j60]Martin Skutella, Maxim Sviridenko, Marc Uetz:
Unrelated Machine Scheduling with Stochastic Processing Times. Math. Oper. Res. 41(3): 851-864 (2016) - [j59]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. Math. Oper. Res. 41(3): 1022-1038 (2016) - [j58]Ravishankar Krishnaswamy, Maxim Sviridenko:
Inapproximability of the Multilevel Uncapacitated Facility Location Problem. ACM Trans. Algorithms 13(1): 1:1-1:25 (2016) - [c73]Edo Liberty, Ram Sriharsha, Maxim Sviridenko:
An Algorithm for Online K-Means Clustering. ALENEX 2016: 81-89 - [c72]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A Bi-Criteria Approximation Algorithm for k-Means. APPROX-RANDOM 2016: 14:1-14:20 - [c71]Aris Anagnostopoulos, Ruggiero Cavallo, Stefano Leonardi, Maxim Sviridenko:
Bidding Strategies for Fantasy-Sports Auctions. WINE 2016: 102-115 - [i15]Christopher Musco, Maxim Sviridenko, Justin Thaler:
Determining Tournament Payout Structures for Daily Fantasy Sports. CoRR abs/1601.04203 (2016) - 2015
- [j57]Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. Random Struct. Algorithms 46(3): 541-571 (2015) - [j56]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young:
Approximation algorithms for the joint replenishment problem with deadlines. J. Sched. 18(6): 545-560 (2015) - [c70]Sungjin Im, Maxim Sviridenko:
New Approximations for Broadcast Scheduling via Variants of α-point Rounding. SODA 2015: 1050-1069 - [c69]Maxim Sviridenko, Jan Vondrák, Justin Ward:
Optimal approximation for submodular and supermodular optimization with bounded curvature. SODA 2015: 1134-1148 - [i14]Christos Boutsidis, Edo Liberty, Maxim Sviridenko:
Greedy Minimization of Weakly Supermodular Set Functions. CoRR abs/1502.06528 (2015) - [i13]Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward:
A bi-criteria approximation algorithm for k Means. CoRR abs/1507.04227 (2015) - 2014
- [j55]Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan:
Preemptive and non-preemptive generalized min sum set cover. Math. Program. 145(1-2): 377-401 (2014) - [j54]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. ACM Trans. Algorithms 10(4): 18:1-18:18 (2014) - [c68]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle Packing Problems. ESA 2014: 713-724 - [c67]Konstantin Makarychev, Maxim Sviridenko:
Solving Optimization Problems with Diseconomies of Scale via Decoupling. FOCS 2014: 571-580 - [c66]Lehilton L. C. Pedrosa, Maxim Sviridenko:
Integrated Supply Chain Management via Randomized Rounding. LATIN 2014: 562-573 - [c65]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. STACS 2014: 29-40 - [c64]Martin Skutella, Maxim Sviridenko, Marc Uetz:
Stochastic Scheduling on Unrelated Machines. STACS 2014: 639-650 - [i12]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. CoRR abs/1403.4991 (2014) - [i11]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm. CoRR abs/1403.7721 (2014) - [i10]Konstantin Makarychev, Maxim Sviridenko:
Optimization Problems with Diseconomies of Scale via Decoupling. CoRR abs/1404.3248 (2014) - [i9]Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi:
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. CoRR abs/1412.4709 (2014) - [i8]Edo Liberty, Ram Sriharsha, Maxim Sviridenko:
An Algorithm for Online K-Means Clustering. CoRR abs/1412.5721 (2014) - 2013
- [j53]Dan Andrei Iancu, Mayank Sharma, Maxim Sviridenko:
Supermodularity and Affine Policies in Dynamic Robust Optimization. Oper. Res. 61(4): 941-956 (2013) - [j52]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61(4): 1014-1029 (2013) - [j51]Jon Lee, Maxim Sviridenko, Jan Vondrák:
Matroid Matching: The Power of Local Search. SIAM J. Comput. 42(1): 357-379 (2013) - [j50]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42(2): 579-592 (2013) - [c63]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. FSTTCS 2013: 449-460 - [c62]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young:
Approximation Algorithms for the Joint Replenishment Problem with Deadlines. ICALP (1) 2013: 135-147 - [c61]Marcin Mucha, Maxim Sviridenko:
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. ICALP (1) 2013: 769-779 - [c60]Maxim Sviridenko, Justin Ward:
Large Neighborhood Local Search for the Maximum Set Packing Problem. ICALP (1) 2013: 792-803 - [c59]Tim Nonner, Maxim Sviridenko:
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. IPCO 2013: 314-323 - [c58]Maxim Sviridenko, Andreas Wiese:
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. IPCO 2013: 387-398 - [i7]Marcin Mucha, Maxim Sviridenko:
No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem. CoRR abs/1302.2551 (2013) - [i6]Maxim Sviridenko, Justin Ward:
Large Neighborhood Local Search for the Maximum Set Packing Problem. CoRR abs/1302.4347 (2013) - [i5]Sungjin Im, Maxim Sviridenko:
Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling. CoRR abs/1309.3675 (2013) - [i4]Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. CoRR abs/1310.4415 (2013) - [i3]Maxim Sviridenko, Justin Ward:
Tight Bounds for Submodular and Supermodular Optimization with Bounded Curvature. CoRR abs/1311.4728 (2013) - 2012
- [j49]Maxim Sviridenko:
A note on the Kenyon-Remila strip-packing algorithm. Inf. Process. Lett. 112(1-2): 10-12 (2012) - [j48]Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko:
Discretization orders for distance geometry problems. Optim. Lett. 6(4): 783-796 (2012) - [j47]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012) - [j46]Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
A Complete 4-parametric complexity classification of short shop scheduling problems. J. Sched. 15(4): 427-446 (2012) - [c57]Rishi Saket, Maxim Sviridenko:
New and Improved Bounds for the Minimum Set Cover Problem. APPROX-RANDOM 2012: 288-300 - [c56]Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. SODA 2012: 420-436 - [c55]Warren Schudy, Maxim Sviridenko:
Concentration and moment inequalities for polynomials of independent random variables. SODA 2012: 437-446 - [c54]Ravishankar Krishnaswamy, Maxim Sviridenko:
Inapproximability of the multi-level uncapacitated facility location problem. SODA 2012: 718-734 - [c53]Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan:
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. STACS 2012: 465-476 - 2011
- [j45]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011) - [j44]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36(3): 416-431 (2011) - [j43]Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7(2): 22:1-22:21 (2011) - [c52]Konstantin Makarychev, Maxim Sviridenko:
Maximizing Polynomials Subject to Assignment Constraints. ICALP (1) 2011: 510-520 - [i2]Warren Schudy, Maxim Sviridenko:
Concentration and Moment Inequalities for Polynomials of Independent Random Variables. CoRR abs/1104.4997 (2011) - 2010
- [j42]Jon Lee, Maxim Sviridenko, Jan Vondrák:
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Math. Oper. Res. 35(4): 795-806 (2010) - [j41]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discret. Math. 23(4): 2053-2078 (2010) - [j40]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. ACM Trans. Algorithms 6(2): 35:1-35:21 (2010) - [c51]Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. ICALP (1) 2010: 594-604 - [c50]Jon Lee, Maxim Sviridenko, Jan Vondrák:
Matroid matching: the power of local search. STOC 2010: 369-378
2000 – 2009
- 2009
- [j39]Viswanath Nagarajan, Maxim Sviridenko:
Tight Bounds for Permutation Flow Shop Scheduling. Math. Oper. Res. 34(2): 417-427 (2009) - [j38]Viswanath Nagarajan, Maxim Sviridenko:
On the Maximum Quadratic Assignment Problem. Math. Oper. Res. 34(4): 859-868 (2009) - [j37]Markus Bläser, L. Shankar Ram, Maxim Sviridenko:
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. Oper. Res. Lett. 37(3): 176-180 (2009) - [j36]Eric Allender, Vladlen Koltun, Maxim Sviridenko:
Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007). SIAM J. Comput. 39(3): 978 (2009) - [j35]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko:
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. SIAM J. Comput. 39(4): 1256-1278 (2009) - [j34]Refael Hassin, Asaf Levin, Maxim Sviridenko:
Approximating the minimum quadratic assignment problems. ACM Trans. Algorithms 6(1): 18:1-18:10 (2009) - [c49]Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko:
On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216 - [c48]Jon Lee, Maxim Sviridenko, Jan Vondrák:
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. APPROX-RANDOM 2009: 244-257 - [c47]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46 - [c46]Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
Complete Complexity Classification of Short Shop Scheduling. CSR 2009: 227-236 - [c45]Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko:
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC 2009: 77-86 - [c44]Viswanath Nagarajan, Maxim Sviridenko:
On the maximum quadratic assignment problem. SODA 2009: 516-524 - [c43]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332 - [i1]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints. CoRR abs/0902.0353 (2009) - 2008
- [j33]Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko:
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Manag. Sci. 54(4): 763-776 (2008) - [j32]Retsef Levi, Andrea Lodi, Maxim Sviridenko:
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities. Math. Oper. Res. 33(2): 461-474 (2008) - [j31]Tracy Kimbrel, Maxim Sviridenko:
High-multiplicity cyclic job shop scheduling. Oper. Res. Lett. 36(5): 574-578 (2008) - [j30]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing with monotonicity constraint. Oper. Res. Lett. 36(5): 609-614 (2008) - [j29]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko:
Improved Approximation Algorithms for Broadcast Scheduling. SIAM J. Comput. 38(3): 1157-1174 (2008) - [j28]Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko:
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4(3): 34:1-34:17 (2008) - [c42]Viswanath Nagarajan, Maxim Sviridenko:
Tight Bounds for Permutation Flow Shop Scheduling. IPCO 2008: 154-168 - [c41]Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko:
Min Sum Edge Coloring in Multigraphs Via Configuration LP. IPCO 2008: 359-373 - [c40]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA 2008: 952-961 - [r1]Maxim Sviridenko:
Minimum Makespan on Unrelated Machines. Encyclopedia of Algorithms 2008 - 2007
- [j27]Nikhil Bansal, Maxim Sviridenko:
Two-dimensional bin packing with one-dimensional resource augmentation. Discret. Optim. 4(2): 143-153 (2007) - [j26]Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz:
Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM J. Res. Dev. 51(3/4): 391-408 (2007) - [j25]Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
Machine scheduling with resource dependent processing times. Math. Program. 110(1): 209-228 (2007) - [c39]Matthew Kaplan, Tracy Kimbrel, Kevin Mckenzie, Richard Prewitt, Maxim Sviridenko, Clay Williams, Cemal Yilmaz:
Test Machine Scheduling and Optimization for z/ OS. CISched 2007: 27-34 - [c38]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing for homogeneous items. CTW 2007: 57-60 - [c37]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Bundle Pricing with Comparable Items. ESA 2007: 475-486 - [c36]Retsef Levi, Andrea Lodi, Maxim Sviridenko:
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. IPCO 2007: 454-468 - [c35]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. SODA 2007: 726-735 - [c34]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206 - 2006
- [j24]Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko:
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. Math. Oper. Res. 31(1): 31-49 (2006) - [j23]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko:
Job Shop Scheduling with Unit Processing Times. Math. Oper. Res. 31(2): 381-389 (2006) - [j22]Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. J. Sched. 9(4): 365-379 (2006) - [j21]Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan:
Approximation algorithms for shop scheduling problems with minsum objective: A correction. J. Sched. 9(6): 569-570 (2006) - [c33]Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. APPROX-RANDOM 2006: 140-151 - [c32]Retsef Levi, Maxim Sviridenko:
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. APPROX-RANDOM 2006: 188-199 - [c31]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko:
Improved approximation algorithms for multidimensional bin packing problems. FOCS 2006: 697-708 - [c30]Nikhil Bansal, Don Coppersmith, Maxim Sviridenko:
Improved approximation algorithms for broadcast scheduling. SODA 2006: 344-353 - [c29]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620 - [c28]Nikhil Bansal, Maxim Sviridenko:
The Santa Claus problem. STOC 2006: 31-40 - [c27]Alexei A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi:
Dynamic placement for clustered web applications. WWW 2006: 595-604 - 2005
- [j20]David Gamarnik, Maxim Sviridenko:
Hamiltonian completions of sparse random graphs. Discret. Appl. Math. 152(1-3): 139-158 (2005) - [j19]Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005) - [j18]Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko:
Minimizing Makespan in No-Wait Job Shops. Math. Oper. Res. 30(4): 817-831 (2005) - [j17]David Gamarnik, Moshe Lewenstein, Maxim Sviridenko:
An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett. 33(5): 467-474 (2005) - [c26]Nikhil Bansal, Andrea Lodi, Maxim Sviridenko:
A Tale of Two Dimensional Bin Packing. FOCS 2005: 657-666 - [c25]Alexander Grigoriev, Maxim Sviridenko, Marc Uetz:
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. IPCO 2005: 182-195 - [c24]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko:
Job shop scheduling with unit processing times. SODA 2005: 207-214 - [c23]Markus Bläser, L. Shankar Ram, Maxim Sviridenko:
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. WADS 2005: 350-359 - [c22]Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi:
Dynamic Application Placement Under Service and Memory Constraints. WEA 2005: 391-402 - 2004
- [j16]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica 39(2): 175-187 (2004) - [j15]Maxim Sviridenko:
A Note on Permutation Flow Shop Problem. Ann. Oper. Res. 129(1-4): 247-252 (2004) - [j14]Alexander A. Ageev, Maxim Sviridenko:
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. J. Comb. Optim. 8(3): 307-328 (2004) - [j13]Maxim Sviridenko:
A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1): 41-43 (2004) - [j12]Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko:
Buffer Overflow Management in QoS Switches. SIAM J. Comput. 33(3): 563-583 (2004) - [c21]Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 - [c20]Nikhil Bansal, Maxim Sviridenko:
New approximability and inapproximability results for 2-dimensional Bin Packing. SODA 2004: 196-203 - [c19]Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. SODA 2004: 982-991 - 2003
- [j11]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM J. Discret. Math. 16(2): 288-300 (2003) - [j10]Maxim Sviridenko:
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme. SIAM J. Discret. Math. 16(2): 313-322 (2003) - [j9]Moshe Lewenstein, Maxim Sviridenko:
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. SIAM J. Discret. Math. 17(2): 237-248 (2003) - [c18]Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-65 - [c17]Moshe Lewenstein, Maxim Sviridenko:
Approximating asymmetric maximum TSP. SODA 2003: 646-654 - 2002
- [j8]Maurice Queyranne, Maxim Sviridenko:
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. J. Algorithms 45(2): 202-212 (2002) - [j7]Alexander V. Kononov, Maxim Sviridenko:
A linear time approximation scheme for makespan minimization in an open shop with release dates. Oper. Res. Lett. 30(4): 276-280 (2002) - [j6]Don Coppersmith, David Gamarnik, Maxim Sviridenko:
The diameter of a long-range percolation graph. Random Struct. Algorithms 21(1): 1-13 (2002) - [c16]Maxim Sviridenko:
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. IPCO 2002: 240-257 - [c15]Don Coppersmith, David Gamarnik, Maxim Sviridenko:
The diameter of a long range percolation graph. SODA 2002: 329-337 - [c14]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. SWAT 2002: 280-287 - 2001
- [j5]Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. Algorithmica 30(3): 398-405 (2001) - [j4]Esther M. Arkin, Refael Hassin, Maxim Sviridenko:
Approximating the maximum quadratic assignment problem. Inf. Process. Lett. 77(1): 13-16 (2001) - [j3]Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. SIAM J. Discret. Math. 14(2): 246-255 (2001) - [c13]Maurice Queyranne, Maxim Sviridenko:
A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. IPCO 2001: 361-369 - [c12]Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko:
Buffer overflow management in QoS switches. STOC 2001: 520-529 - [c11]T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko:
Online server allocation in a server farm via benefit task systems. STOC 2001: 540-549 - 2000
- [j2]Maxim Sviridenko:
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem. Oper. Res. Lett. 26(4): 193-197 (2000) - [c10]Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts. APPROX 2000: 34-41 - [c9]Alexander A. Ageev, Maxim Sviridenko:
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. ESA 2000: 32-41 - [c8]Maxim Sviridenko, Gerhard J. Woeginger:
Approximability and in-approximability results for no-wait shop scheduling. FOCS 2000: 116-125 - [c7]Maurice Queyranne, Maxim Sviridenko:
New and improved algorithms for minsum shop scheduling. SODA 2000: 871-878 - [c6]Klaus Jansen, Maxim Sviridenko:
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. STACS 2000: 455-465
1990 – 1999
- 1999
- [j1]Alexander A. Ageev, Maxim Sviridenko:
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. Discret. Appl. Math. 93(2-3): 149-156 (1999) - [c5]Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44 - [c4]Alexander A. Ageev, Maxim Sviridenko:
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. IPCO 1999: 17-30 - [c3]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. RANDOM-APPROX 1999: 177-188 - [c2]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. STOC 1999: 394-399 - 1998
- [c1]Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. APPROX 1998: 193-199
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
