A (slightly) improved approximation algorithm for metric TSP
Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan
2021年份
114被引次数
23顶会引用
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式，引用它的顶会 Paper 也一样。你提问，回答直接引用原文。
引用它的顶会 Paper23
- FrontierCO: Real-World and Large-Scale Evaluation of Machine Learning Solvers for Combinatorial OptimizationShengyu Feng, Weiwei Sun, Shanda Li, Ameet Talwalkar 等ICLR 2026 · 被引用 13 次
- A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSPAnna R. Karlin, Nathan Klein, Shayan Oveis GharanFOCS 2022 · 被引用 13 次
- An Improved Approximation Guarantee for Prize-Collecting TSPJannis Blauth, Martin NägeleSTOC 2023 · 被引用 7 次
- NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection GraphsEvan McCarty, Qi Zhao, Anastasios Sidiropoulos, Yusu WangNeurIPS 2021 · 被引用 6 次
- An improved approximation algorithm for the minimum k-edge connected multi-subgraph problemAnna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi ZhangSTOC 2022 · 被引用 6 次
它引用的顶会 Paper3
相关 Paper
- An improved approximation algorithm for ATSPVera Traub, Jens VygenSTOC 2020
- FPT Approximation Algorithms for TSP on Non-Metric GraphsJingyang Zhao, Zimo Sheng, Mingyu XiaoAAAI 2026
- Approximating Traveling Salesman Problems Using a Bridge LemmaMartin Böhm, Zachary Friggstad, Tobias Mömke, Joachim SpoerhaseSODA 2025 · 被引用 1 次
- Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection GraphsSándor Kisfaludi-Bak, Dániel MarxSTOC 2026
- Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spacesYair Bartal, Lee-Ad GottliebSTOC 2021 · 被引用 5 次
