3 citations · 3 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022
Deterministic, Near-Linear -Approximation Algorithm for Geometric Bipartite Matching
Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra +1
Given point sets and in where and have equal size for some constant dimension and a parameter , we present the first determini…
cs.DS2019
Efficient Algorithms for Geometric Partial Matching
Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao
Let and be two point sets in the plane of sizes and respectively (assume ), and let be a parameter. A matching between and is a family of pair…
cs.DS2019★ 3 cited
Faster Algorithms for the Geometric Transportation Problem
Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi +2
Let and be two point sets in , with and where is a constant. Next, let such that $\sum_{r \in R } λ(r) = \sum_…