Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
-time Algorithm for Bounded Tree Edit Distance
Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi +3
Computing the edit distance of two strings is one of the most basic problems in computer science and combinatorial optimization. Tree edit distance is a natural generalization of e…
cs.DS2022
Generalized Stochastic Matching
Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi
In this paper, we generalize the recently studied Stochastic Matching problem to more accurately model a significant medical process, kidney exchange, and several other application…
cs.DS2020
Competitively Pricing Parking in a Tree
Max Bender, Jacob Gilbert, Aditya Krishnan +1
Motivated by demand-responsive parking pricing systems we consider posted-price algorithms for the online metrical matching problem and the online metrical searching problem in a t…