research
∙
05/26/2023
Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs
In this paper, we design sub-linear space streaming algorithms for estim...
share
research
∙
03/16/2022
Tight Lower Bounds for Approximate Exact k-Center in ℝ^d
In the discrete k-center problem, we are given a metric space (P,) where...
research
∙
01/26/2021
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
(see paper for full abstract) We show that the Edge-Disjoint Paths pro...
research
∙
11/29/2019
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
(see paper for full abstract) Given a vertex-weighted directed graph G...
research
∙
11/20/2019
Towards a Theory of Parameterized Streaming Algorithms
Parameterized complexity attempts to give a more fine-grained analysis o...
research
∙
10/03/2019
FPT Inapproximability of Directed Cut and Connectivity Problems
(see paper for full abstract) Cut problems and connectivity problems o...
research
∙
07/20/2017
Parameterized Approximation Algorithms for Directed Steiner Network Problems
(See paper for full abstract) Given an edge-weighted directed graph G=...
research
∙
04/30/2012
A Game-Theoretic Model Motivated by the DARPA Network Challenge
In this paper we propose a game-theoretic model to analyze events simila...
research
∙
05/03/2011
