Minimum cost source location problem with vertex-connectivity requirements in digraphs

Hiroshi Nagamochi, Toshimasa Ishii, Hiro Ito. Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett., 80(6):287-293, 2001. [doi]

@article{NagamochiII01,
  title = {Minimum cost source location problem with vertex-connectivity requirements in digraphs},
  author = {Hiroshi Nagamochi and Toshimasa Ishii and Hiro Ito},
  year = {2001},
  doi = {10.1016/S0020-0190(01)00183-1},
  url = {http://dx.doi.org/10.1016/S0020-0190(01)00183-1},
  researchr = {https://researchr.org/publication/NagamochiII01},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {80},
  number = {6},
  pages = {287-293},
}