Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators

Guyslain Naves, F. Bruce Shepherd, Henry Xia. Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. In Mohit Singh, David P. Williamson, editors, Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings. Volume 12707 of Lecture Notes in Computer Science, pages 326-339, Springer, 2021. [doi]

@inproceedings{NavesSX21,
  title = {Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators},
  author = {Guyslain Naves and F. Bruce Shepherd and Henry Xia},
  year = {2021},
  doi = {10.1007/978-3-030-73879-2_23},
  url = {https://doi.org/10.1007/978-3-030-73879-2_23},
  researchr = {https://researchr.org/publication/NavesSX21},
  cites = {0},
  citedby = {0},
  pages = {326-339},
  booktitle = {Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings},
  editor = {Mohit Singh and David P. Williamson},
  volume = {12707},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-73879-2},
}