caa a22 4500 445805048 CHVBK 20180317145154.0 cr unu---uuuuu 170323e20110201xx s 000 0 eng 10.1007/s00453-009-9306-3 doi (NATIONALLICENCE)springer-10.1007/s00453-009-9306-3 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality [Elektronische Daten] [Lukasz Kowalik, Marcin Mucha] We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 which improves on the previous 31/40 factor of Bläser, Ram and Sviridenko (Lecture Notes in Computer Science, vol.3122, pp.350-359, 2005). Springer Science+Business Media, LLC, 2009 Traveling salesman problem nationallicence Asymmetric nationallicence Maximum nationallicence Triangle inequality nationallicence Approximation nationallicence Algorithm nationallicence Kowalik Lukasz Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warszawa, Poland aut Mucha Marcin Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warszawa, Poland aut Algorithmica Springer-Verlag 59/2(2011-02-01), 240-255 0178-4617 59:2<240 2011 59 453 https://doi.org/10.1007/s00453-009-9306-3 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00453-009-9306-3 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Kowalik Lukasz Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warszawa, Poland aut NATIONALLICENCE 700 1- Mucha Marcin Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warszawa, Poland aut NATIONALLICENCE 773 0- Algorithmica Springer-Verlag 59/2(2011-02-01), 240-255 0178-4617 59:2<240 2011 59 453 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer