English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem

MPS-Authors
/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45654

Van Zuylen,  Anke
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2012/3412/
(Any fulltext)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Elbassioni, K., Paluch, K., & Van Zuylen, A. (2012). Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. In C. Dürr, & T. Wilke (Eds.), 29th International Symposium on Theoretical Aspects of Computer Science: STACS'12 (pp. 501-506). Dagstuhl: Schloss Dagstuhl/ Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.STACS.2012.501.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-F71E-5
Abstract
There is no abstract available