A (slightly) improved approximation algorithm for metric TSP
| Year of publication: |
2024
|
|---|---|
| Authors: | Karlin, Anna R. ; Klein, Nathan ; Gharan, Shayan Oveis |
| Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 72.2024, 6, p. 2543-2594
|
| Subject: | approximation algorithms | maximum entropy distributions | Optimization | random spanning trees | strongly Rayleigh distributions | traveling salesperson problem | Algorithmus | Algorithm | Entropie | Entropy | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research |
-
Budgeted prize-collecting traveling salesman and minimum spanning tree problems
Paul, Alice, (2020)
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
-
Goerigk, Marc, (2024)
- More ...
-
Simple pricing schemes for consumers with evolving values
Chawla, Shuchi, (2022)
-
On the equilibria and efficiency of the GSP mechanism in keyword auctions with externalities
Giotis, Ioannis, (2008)
-
Combinatorial auctions with interdependent valuations : SOS to the rescue
Eden, Alon, (2024)
- More ...