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
∙
11/22/2022
On Narrative Information and the Distillation of Stories
The act of telling stories is a fundamental part of what it means to be ...
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/14/2021
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems
We consider the rooted prize-collecting walks (PCW) problem, wherein we ...
research
∙
11/04/2021
A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs
We give the first constant-factor approximation algorithm for quasi-bipa...
research
∙
11/03/2021
Automatic Embedding of Stories Into Collections of Independent Media
We look at how machine learning techniques that derive properties of ite...
research
∙
12/12/2019
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
We give the first constant-factor approximation for the Directed Latency...
research
∙
12/10/2019
Graph Pricing with Limited Supply
We study approximation algorithms for graph pricing with vertex capaciti...
research
∙
07/14/2018
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
We investigate the complexity of solving stable or perturbation-resilien...
research
∙
03/29/2016