62 citations · 175 across the 40 of their papers we have counts for
4 papers · 2 filters
Generalized max-weight policies in stochastic matching
Matthieu Jonckheere, Pascal Moyal, Claudia Ramírez +1
We consider a matching system where items arrive one by one at each node of a compatibility network according to Poisson processes and depart from it as soon as they are matched to…
Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs
Paola Bermolen, Matthieu Jonckheere, Federico Larroca +1
Computing the size of maximum independent sets is a NP-hard problem for fixed graphs. Characterizing and designing efficient algorithms to estimate this independence number for ran…
Large Deviation Principle for the Greedy Exploration Algorithm over Erdös-Rényi Graphs
P. Bermolen, V. Goicoechea, M. Jonckheere +1
We prove a large deviation principle for a greedy exploration process on an Erdös-Rényi (ER) graph when the number of nodes goes to infinity. To prove our main result, we use the g…
Stability of JSQ in queues with general server-job class compatibilities
James Cruise, Matthieu Jonckheere, Seva Shneer
We consider Poisson streams of exponentially distributed jobs arriving at each edge of a hypergraph of queues. Upon arrival, an incoming job is rooted to the shortest queue among t…