A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
METADATA ONLY
Loading...
Author / Producer
Date
2022
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Permanent link
Publication status
published
External links
Editor
Book title
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
Journal / series
Volume
Pages / Article No.
351 - 362
Publisher
IEEE
Event
62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2021)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Traveling Salesman Problem; Steiner Tree; Euclidean; Approximation; Gap-ETH