%0 Conference Paper %1 conf/focs/KaplanLSS03 %A Kaplan, Haim %A Lewenstein, Moshe %A Shafrir, Nira %A Sviridenko, Maxim %B FOCS %D 2003 %I IEEE Computer Society %K dblp %P 56-65 %T Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. %U http://dblp.uni-trier.de/db/conf/focs/focs2003.html#KaplanLSS03 %@ 0-7695-2040-5

@inproceedings{conf/focs/KaplanLSS03, added-at = {2017-05-19T00:00:00.000+0200}, author = {Kaplan, Haim and Lewenstein, Moshe and Shafrir, Nira and Sviridenko, Maxim}, biburl = {https://www.bibsonomy.org/bibtex/29e5176fb72c89df279bb6ecec1927b15/dblp}, booktitle = {FOCS}, crossref = {conf/focs/2003}, ee = {https://doi.org/10.1109/SFCS.2003.1238181}, interhash = {dd88970eb640a50253cffb4f25a7089d}, intrahash = {9e5176fb72c89df279bb6ecec1927b15}, isbn = {0-7695-2040-5}, keywords = {dblp}, pages = {56-65}, publisher = {IEEE Computer Society}, timestamp = {2019-10-17T16:11:18.000+0200}, title = {Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.}, url = {http://dblp.uni-trier.de/db/conf/focs/focs2003.html#KaplanLSS03}, year = 2003 }