Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Sviridenko, Maxim - IBM T.J. Watson Research Center
Structural Properties of Preemptive Schedules Ph. Baptiste
Approximation Algorithms for Shop Scheduling Problems with Minsum Objective y
An Approximation Algorithm for MAX DICUT with Given Sizes of Parts
Best possible approximation algorithm for MAX SAT with cardinality constraint
BIN PACKING IN MULTIPLE DIMENSIONS: INAPPROXIMABILITY RESULTS AND APPROXIMATION SCHEMES
Minimizing makespan in nowait job shops Nikhil Bansal # Mohammad Mahdian + Maxim Sviridenko #
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem
Approximability and inapproximability results for nowait shop scheduling
Hamiltonian Completions of Sparse Random Graphs David Gamarnik # Maxim Sviridenko +
Matroid Matching: the Power of Local Search Jon Lee Maxim Sviridenko Jan Vondrak
Approximations for Maximum Transportation Problem with Permutable Supply Vector and other Capacitated Star Packing
Approximating the Maximum Quadratic Assignment Problem 1 Esther M. Arkin 2 Refael Hassin 3 Maxim Sviridenko 4
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
Pipage Rounding: a New Method of Constructing Algorithms with Proven
Improved approximation algorithms for Broadcast Scheduling Nikhil Bansal Don Coppersmith Maxim Sviridenko #
An Improved Upper Bound for TSP in Cubic 3Connected Graphs
A (2 + ")-approximation algorithm for generalized preemptive open shop problem with minsum criteria
Harmonic algorithm for 3Dimensional Strip Packing Problem Nikhil Bansal # Xin Han + Kazuo Iwama # Maxim Sviridenko Guochuan Zhang
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
A note on maximizing a submodular set function subject to knapsack constraint
The Santa Claus Problem [Extended Abstract]
Worst-Case Analysis of the Greedy Algorithm for a Generalization of the Maximum P-Facility Location
MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxxxxx
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A Constant Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
Submodular Maximization Over Multiple Matroids via Generalized Exchange Properties
MAXIMIZING NON-MONOTONE SUBMODULAR FUNCTIONS UNDER MATROID AND KNAPSACK CONSTRAINTS
Tight Bounds for Permutation Flow Shop Viswanath Nagarajan Maxim Sviridenko
Unrelated parallel machine scheduling with resource dependent processing times
Approximating the minimum quadratic assignment problems Refael Hassin
Dynamic application placement under service and memory constraints
A Note on Permutation Flow Shop Problem M.I. Sviridenko #
Test Machine Scheduling and Optimization for z/OS Matthew Kaplan Tracy Kimbrel1
An 0.828 Approximation Algorithm for the Uncapacitated Facility Location Problem \Lambda