%0 Journal Article %1 journals/dam/AverbakhB97 %A Averbakh, Igor %A Berman, Oded %D 1997 %J Discret. Appl. Math. %K dblp %N 3 %P 201-216 %T (p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. %U http://dblp.uni-trier.de/db/journals/dam/dam75.html#AverbakhB97 %V 75

@article{journals/dam/AverbakhB97, added-at = {2021-02-11T00:00:00.000+0100}, author = {Averbakh, Igor and Berman, Oded}, biburl = {https://www.bibsonomy.org/bibtex/2644e218dae549282275327a00717f71c/dblp}, ee = {https://doi.org/10.1016/S0166-218X(97)89161-5}, interhash = {68e4830dcdf062bc8be79f5e13cacd74}, intrahash = {644e218dae549282275327a00717f71c}, journal = {Discret. Appl. Math.}, keywords = {dblp}, number = 3, pages = {201-216}, timestamp = {2024-04-09T01:24:58.000+0200}, title = {(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective.}, url = {http://dblp.uni-trier.de/db/journals/dam/dam75.html#AverbakhB97}, volume = 75, year = 1997 }