research
∙
02/09/2023
An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs
We present an O(log k)-approximation for both the edge-weighted and node...
share
research
∙
12/19/2021
Parameterized Approximation Algorithms for k-Center Clustering and Variants
k-center is one of the most popular clustering models. While it admits a...
research
∙
11/15/2021
Improved Approximations for CVRP with Unsplittable Demands
In this paper, we present improved approximation algorithms for the (uns...
research
∙
11/04/2021