8 citations · 8 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Online Hypergraph Matching with Delays
Marco Pavone, Amin Saberi, Maximilian Schiffer +1
We study an online hypergraph matching problem with delays, motivated by ridesharing applications. In this model, users enter a marketplace sequentially, and are willing to wait up…
cs.DS2019
Sample Complexity of Probabilistic Roadmaps via -nets
Matthew Tsao, Kiril Solovey, Marco Pavone
We study fundamental theoretical aspects of probabilistic roadmaps (PRM) in the finite time (non-asymptotic) regime. In particular, we investigate how completeness and optimality g…