3 papers
cs.DS2026
Online Min-Cost Matching with General Arrivals
Josh Ascher, Eric Balkanski, Jason Chatzitheodorou +1
In the classic online min-cost matching problem, the goal is to match a sequence of requests that arrive dynamically over time to a set of static servers, aiming to minimize the to…
cs.DS2023
An -Competitive Posted-Price Algorithm for Online Matching on the Line
Stephen Arndt, Josh Ascher, Kirk Pruhs
Motivated by demand-responsive parking pricing systems, we consider posted-price algorithms for the online metric matching problem. We give an -competitive posted-price…
math.DG2022
Carnot-Caratheodory and Koranyi-Geodesics in the Heisenberg Group
Josh Ascher, Armin Schikorra
This paper is part of an undergraduate research project. We discuss the Heisenberg group H1, the three-dimensional space R3 equipped with one of two equivalent metrics, the Koranyi…