A note on approximating the min-max vertex disjoint paths on directed acyclic graphs

Bang Ye Wu. A note on approximating the min-max vertex disjoint paths on directed acyclic graphs. J. Comput. Syst. Sci., 77(6):1054-1057, 2011. [doi]

@article{Wu11-51,
  title = {A note on approximating the min-max vertex disjoint paths on directed acyclic graphs},
  author = {Bang Ye Wu},
  year = {2011},
  doi = {10.1016/j.jcss.2010.08.012},
  url = {http://dx.doi.org/10.1016/j.jcss.2010.08.012},
  researchr = {https://researchr.org/publication/Wu11-51},
  cites = {0},
  citedby = {0},
  journal = {J. Comput. Syst. Sci.},
  volume = {77},
  number = {6},
  pages = {1054-1057},
}