k-Trails: Recognition, Complexity, and Approximations

Mohit Singh, Rico Zenklusen. k-Trails: Recognition, Complexity, and Approximations. In Quentin Louveaux, Martin Skutella, editors, Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Volume 9682 of Lecture Notes in Computer Science, pages 114-125, Springer, 2016. [doi]

@inproceedings{SinghZ16,
  title = {k-Trails: Recognition, Complexity, and Approximations},
  author = {Mohit Singh and Rico Zenklusen},
  year = {2016},
  doi = {10.1007/978-3-319-33461-5_10},
  url = {http://dx.doi.org/10.1007/978-3-319-33461-5_10},
  researchr = {https://researchr.org/publication/SinghZ16},
  cites = {0},
  citedby = {0},
  pages = {114-125},
  booktitle = {Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings},
  editor = {Quentin Louveaux and Martin Skutella},
  volume = {9682},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-33460-8},
}