| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Maxim Sviridenko |
A note on the Kenyon-Remila strip-packing algorithm.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko |
Discretization orders for distance geometry problems. |
Optimization Letters |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Makarychev, Warren Schudy, Maxim Sviridenko |
Concentration inequalities for nonlinear matroid intersection. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ravishankar Krishnaswamy, Maxim Sviridenko |
Inapproximability of the multi-level uncapacitated facility location problem. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Warren Schudy, Maxim Sviridenko |
Concentration and moment inequalities for polynomials of independent random variables. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan |
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko |
Sum edge coloring of multigraphs via configuration LP. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Warren Schudy, Maxim Sviridenko |
Concentration and Moment Inequalities for Polynomials of Independent Random Variables |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko |
Properties of optimal schedules in preemptive shop scheduling. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Makarychev, Maxim Sviridenko |
Maximizing Polynomials Subject to Assignment Constraints. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko |
Dynamic pricing for impatient bidders. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Maxim Sviridenko, Jan Vondrák |
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. |
Math. Oper. Res. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko |
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko |
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Maxim Sviridenko, Jan Vondrák |
Matroid matching: the power of local search. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
Sherali-Adams hierarchy, local search, matching, matroid |
| 1 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin, Maxim Sviridenko |
Approximating the minimum quadratic assignment problems. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Viswanath Nagarajan, Maxim Sviridenko |
Tight Bounds for Permutation Flow Shop Scheduling. |
Math. Oper. Res. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Viswanath Nagarajan, Maxim Sviridenko |
On the Maximum Quadratic Assignment Problem. |
Math. Oper. Res. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko |
Non-monotone submodular maximization under matroid and knapsack constraints |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Vladlen Koltun, Maxim Sviridenko |
Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007). |
SIAM J. Comput. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nikhil Bansal, Alberto Caprara, Maxim Sviridenko |
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kononov, Sergey Sevastyanov, Maxim Sviridenko |
Complete Complexity Classification of Short Shop Scheduling. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko |
Integrality Property in Preemptive Parallel Machine Scheduling. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Viswanath Nagarajan, Maxim Sviridenko |
On the maximum quadratic assignment problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko |
On Hardness of Pricing Items for Single-Minded Bidders. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Maxim Sviridenko, Jan Vondrák |
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko |
Non-monotone submodular maximization under matroid and knapsack constraints. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, matroids, knapsacks, submodular functions |
| 1 | Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld |
Optimal bundle pricing with monotonicity constraint. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tracy Kimbrel, Maxim Sviridenko |
High-multiplicity cyclic job shop scheduling. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
capacitated covering, rectangle stabbing, Approximation algorithms, lot sizing |
| 1 | Retsef Levi, Andrea Lodi, Maxim Sviridenko |
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities. |
Math. Oper. Res. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko |
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. |
Management Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Don Coppersmith, Maxim Sviridenko |
Improved Approximation Algorithms for Broadcast Scheduling. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko |
Minimum Makespan on Unrelated Machines. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko |
Online make-to-order joint replenishment model: primal dual competitive algorithms. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Viswanath Nagarajan, Maxim Sviridenko |
Tight Bounds for Permutation Flow Shop Scheduling. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko |
Min Sum Edge Coloring in Multigraphs Via Configuration LP. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
Edge Scheduling, Configuration LP, Approximation Algorithms |
| 1 | Nikhil Bansal, Maxim Sviridenko |
Two-dimensional bin packing with one-dimensional resource augmentation. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 Journal of Research and Development |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Grigoriev, Maxim Sviridenko, Marc Uetz |
Machine scheduling with resource dependent processing times. |
Math. Program. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90B35, 68Q25, 68M20 |
| 1 | Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld |
Bundle Pricing with Comparable Items. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko |
Dynamic pricing for impatient bidders. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang |
Harmonic algorithm for 3-dimensional strip packing problem. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Andrea Lodi, Maxim Sviridenko |
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
scheduling theory and algorithms, approximation algorithms, integer programming, randomized algorithms, polyhedral combinatorics |
| 1 | Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld |
Optimal bundle pricing for homogeneous items. |
CTW |
2007 |
DBLP BibTeX RDF |
|
| 1 | Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan |
Approximation algorithms for shop scheduling problems with minsum objective: A correction. |
J. Scheduling |
2006 |
DBLP DOI BibTeX RDF |
Shop scheduling, Approximation algorithms |
| 1 | Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko |
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. |
J. Scheduling |
2006 |
DBLP DOI BibTeX RDF |
Persistent tasks, Multiprocessor scheduling, Process migration, Fair scheduling |
| 1 | Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko |
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes. |
Math. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko |
Job Shop Scheduling with Unit Processing Times. |
Math. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko |
Tight approximation algorithms for maximum general assignment problems. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Don Coppersmith, Maxim Sviridenko |
Improved approximation algorithms for broadcast scheduling. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi |
Dynamic placement for clustered web applications. |
WWW |
2006 |
DBLP DOI BibTeX RDF |
dynamic application placement, performance management |
| 1 | Alexander Grigoriev, Maxim Sviridenko, Marc Uetz |
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Maxim Sviridenko |
Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Alberto Caprara, Maxim Sviridenko |
Improved approximation algorithms for multidimensional bin packing problems. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Maxim Sviridenko |
The Santa Claus problem. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
maximin, unrelated machines, scheduling, approximation algorithms, resource allocation |
| 1 | David Gamarnik, Moshe Lewenstein, Maxim Sviridenko |
An improved upper bound for the TSP in cubic 3-edge-connected graphs. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms |
| 1 | Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko |
Minimizing Makespan in No-Wait Job Shops. |
Math. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | David Gamarnik, Maxim Sviridenko |
Hamiltonian completions of sparse random graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko |
Job shop scheduling with unit processing times. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi |
Dynamic Application Placement Under Service and Memory Constraints. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Grigoriev, Maxim Sviridenko, Marc Uetz |
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Andrea Lodi, Maxim Sviridenko |
A Tale of Two Dimensional Bin Packing. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko |
A note on maximizing a submodular set function subject to a knapsack constraint. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Maxim Sviridenko |
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
rounding technique, maximum coverage, approximation algorithm, performance guarantee, max cut, linear relaxation |
| 1 | Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko |
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Approximation algorithm, NP-complete problem, Transportation problem |
| 1 | Maxim Sviridenko |
A Note on Permutation Flow Shop Problem. |
Annals OR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko |
Buffer Overflow Management in QoS Switches. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko |
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Maxim Sviridenko |
New approximability and inapproximability results for 2-dimensional Bin Packing. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko |
Further Improvements in Competitive Guarantees for QoS Buffering. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein, Maxim Sviridenko |
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Maxim Sviridenko |
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko |
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Moshe Lewenstein, Maxim Sviridenko |
Approximating asymmetric maximum TSP. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kononov, Maxim Sviridenko |
A linear time approximation scheme for makespan minimization in an open shop with release dates. |
Oper. Res. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Don Coppersmith, David Gamarnik, Maxim Sviridenko |
The diameter of a long-range percolation graph. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Queyranne, Maxim Sviridenko |
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Don Coppersmith, David Gamarnik, Maxim Sviridenko |
The diameter of a long range percolation graph. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko |
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. |
IPCO |
2002 |
DBLP BibTeX RDF |
|
| 1 | Esther M. Arkin, Refael Hassin, Maxim Sviridenko |
Approximating the maximum quadratic assignment problem. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko |
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Refael Hassin, Maxim Sviridenko |
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Queyranne, Maxim Sviridenko |
A (2+epsilon)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko |
Buffer overflow management in QoS switches. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko |
Online server allocation in a server farm via benefit task systems. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko |
Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem. |
Oper. Res. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Maxim Sviridenko |
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Queyranne, Maxim Sviridenko |
New and improved algorithms for minsum shop scheduling. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Maxim Sviridenko |
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Refael Hassin, Maxim Sviridenko |
An approximation algorithm for MAX DICUT with given sizes of parts. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko, Gerhard J. Woeginger |
Approximability and in-approximability results for no-wait shop scheduling. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
in-approximability results, no-wait shop scheduling, makespan criterion, computational complexity, approximability, processor scheduling, polynomial time approximation scheme, polynomial approximation, APX-hard |
| 1 | Alexander A. Ageev, Maxim Sviridenko |
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Ageev, Maxim Sviridenko |
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")