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:3588395
Jump to:navigation, search

DOI10.1007/978-3-642-15369-3_1zbMath1304.68205arXiv2012.14233OpenAlexW3117451434MaRDI QIDQ3588395

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

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (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:3588395&oldid=16999693"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 03:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki