Author:
Gupta† Anupam,Newman Ilan,Rabinovich Yuri,Sinclair‡ Alistair
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Cited by
84 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter;ACM Transactions on Algorithms;2024-01-22
2. A 2-approximation for the bounded treewidth sparsest cut problem in $$\textsf{FPT}$$ Time;Mathematical Programming;2024-01-04
3. Covering Planar Metrics (and Beyond): O(1) Trees Suffice;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. ₁-distortion of Wasserstein metrics: A tale of two dimensions;Transactions of the American Mathematical Society, Series B;2023-08-23
5. Massively Parallel Tree Embeddings for High Dimensional Spaces;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17