Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

From MaRDI portal
Publication:5035879
Jump to:navigation, search

DOI10.1145/3478537OpenAlexW1563055883MaRDI QIDQ5035879

David B. Shmoys, Hyung-Chan An, Robert D. Kleinberg

Publication date: 22 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.14233


zbMATH Keywords

traveling salesman problemapproximation algorithmsbottleneck optimization


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)








This page was built for publication: Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5035879&oldid=19512975"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 11:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki