3 citations · 5 across the 9 of their papers we have counts for
4 papers · 1 filter
Routing-Controlled Spanners
Elena Grigorescu, Nithish Kumar Kumar, Young-San Lin
Designing sparse directed spanners, which are subgraphs that approximately maintain distance constraints, has attracted sustained interest in TCS, especially due to their wide appl…
Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
Elena Grigorescu, Young-San Lin, Maoyuan Song
Learning-augmented algorithms have been extensively studied across the computer science community in the recent years, driven by advances in machine learning predictors, which can…
A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
Elena Grigorescu, Young-San Lin, Maoyuan Song
Learning-augmented algorithms has been extensively studied recently in the computer-science community, due to the potential of using machine learning predictions in order to improv…
Directed Buy-at-Bulk Spanners
Elena Grigorescu, Nithish Kumar, Young-San Lin
We present a framework that unifies directed buy-at-bulk network design and directed spanner problems, namely, buy-at-bulk spanners. The goal is to find a minimum-cost routing solu…