research
∙
04/08/2022
Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching
Given point sets A and B in ℝ^d where A and B have equal size n for some...
share
research
∙
02/29/2020
Dynamic geometric set cover and hitting set
We investigate dynamic versions of geometric set cover and hitting set w...
research
∙
03/22/2019
Efficient Algorithms for Geometric Partial Matching
Let A and B be two point sets in the plane of sizes r and n respectively...
research
∙
03/19/2019
Faster Algorithms for the Geometric Transportation Problem
Let R and B be two point sets in R^d, with |R|+ |B| = n and where d is a...
research
∙
10/24/2018
