Zihan Tan

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
An \(\Omega(\sqrt{\log \|T\|})\) lower bound for Steiner point removal	2024-11-28	Paper
On \((1 + \varepsilon)\)-approximate flow sparsifiers	2024-11-28	Paper
Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics	2024-11-14	Paper
A new conjecture on hardness of 2-CSP's with implications to hardness of densest \(k\)-subgraph and other problems	2024-09-25	Paper
Query complexity of the metric Steiner tree problem	2024-05-14	Paper
Almost-optimal sublinear additive spanners	2024-05-08	Paper
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship	2024-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q6147388	2024-01-15	Paper
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs	2023-12-08	Paper
Almost-linear ε -emulators for planar graphs	2023-12-08	Paper
Towards tight(er) bounds for the excluded grid theorem	2021-02-03	Paper
Erratum for “On the Inequalities of Projected Volumes and the Constructible Region	2020-04-07	Paper
Towards Tight(er) Bounds for the Excluded Grid Theorem	2019-10-15	Paper
On the Inequalities of Projected Volumes and the Constructible Region	2019-05-13	Paper
Comments on Cut-Set Bounds on Network Function Computation	2018-09-19	Paper
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship	2017-02-10	Paper
On the computational complexity of bridgecard	2016-02-23	Paper
On the Meeting Time for Two Random Walks on a Regular Graph	2014-08-08	Paper
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families	N/A	Paper

Research outcomes over time

This page was built for person: Zihan Tan