The following pages link to Zihan Tan (Q247832):
Displaying 15 items.
- Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship (Q2959833) (← links)
- Comments on Cut-Set Bounds on Network Function Computation (Q4682928) (← links)
- Erratum for “On the Inequalities of Projected Volumes and the Constructible Region'' (Q4959762) (← links)
- Towards Tight(er) Bounds for the Excluded Grid Theorem (Q5236272) (← links)
- On the Inequalities of Projected Volumes and the Constructible Region (Q5376541) (← links)
- On the computational complexity of bridgecard (Q5963617) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
- Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families (Q6513699) (← links)
- Query complexity of the metric Steiner tree problem (Q6538709) (← links)
- A new conjecture on hardness of 2-CSP's with implications to hardness of densest \(k\)-subgraph and other problems (Q6610302) (← links)
- Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics (Q6638035) (← links)
- An \(\Omega(\sqrt{\log |T|})\) lower bound for Steiner point removal (Q6645373) (← links)
- On \((1 + \varepsilon)\)-approximate flow sparsifiers (Q6645419) (← links)
- Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances (Q6750369) (← links)
