@InProceedings{bhattacharya_et_al:LIPIcs.FSTTCS.2012.325,
  author =	{Bhattacharya, Binay and Hu, Yuzhuang},
  title =	{{k-delivery traveling salesman problem on tree networks}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)},
  pages =	{325--336},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-47-7},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{18},
  editor =	{D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.325},
  URN =		{urn:nbn:de:0030-drops-38707},
  doi =		{10.4230/LIPIcs.FSTTCS.2012.325},
  annote =	{Keywords: k-delivery traveling salesman problem, approximation algorithms}
}