Min-Max Theorems for Packing and Covering Odd (u, v)-trails

Sharat Ibrahimpur, Chaitanya Swamy. Min-Max Theorems for Packing and Covering Odd (u, v)-trails. In Friedrich Eisenbrand, Jochen Könemann, editors, Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings. Volume 10328 of Lecture Notes in Computer Science, pages 279-291, Springer, 2017. [doi]

@inproceedings{IbrahimpurS17,
  title = {Min-Max Theorems for Packing and Covering Odd (u, v)-trails},
  author = {Sharat Ibrahimpur and Chaitanya Swamy},
  year = {2017},
  doi = {10.1007/978-3-319-59250-3_23},
  url = {https://doi.org/10.1007/978-3-319-59250-3_23},
  researchr = {https://researchr.org/publication/IbrahimpurS17},
  cites = {0},
  citedby = {0},
  pages = {279-291},
  booktitle = {Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
  editor = {Friedrich Eisenbrand and Jochen Könemann},
  volume = {10328},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-59250-3},
}