D
David Gamarnik
Researcher at Massachusetts Institute of Technology
Publications - 227
Citations - 5451
David Gamarnik is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Queueing theory & Random graph. The author has an hindex of 41, co-authored 215 publications receiving 4787 citations. Previous affiliations of David Gamarnik include IBM.
Papers
More filters
Proceedings ArticleDOI
Simple deterministic approximation algorithms for counting matchings
TL;DR: A deterministic fully polynomial time approximationscheme (FPTAS) is constructed for computing the total number of matchings in abounded degree graph and another problem to the small, but growing, class of P-complete problems for which there is now a deterministic FPTAS.
Journal ArticleDOI
Validity of heavy traffic steady-state approximations in generalized Jackson networks
David Gamarnik,Assaf Zeevi +1 more
TL;DR: This paper proves that the re-scaled stationary distribution of the GJN converges to the stationary Distribution of the RBM, thus validating a so-called “interchange-of-limits” for this class of networks.
Journal ArticleDOI
Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions
TL;DR: In this article, a general methodology based on Lyapunov functions was proposed for the performance analysis of infinite state Markov chains and applied specifically to Markovian multiclass queueing networks.
Journal ArticleDOI
Finding long chains in kidney exchange using the traveling salesman problem
TL;DR: Two new algorithms that use integer programming to optimally solve the kidney paired donation problem, one of which is inspired by the techniques used to solve the traveling salesman problem, are developed.
Journal ArticleDOI
Asymptotically optimal algorithms for job shop scheduling and packet routing
TL;DR: These proposed algorithms are asymptotically optimal for all instances with a large number of jobs (packets) and make no probabilistic assumptions and they are within 1% of optimality even for moderately sized problems.