Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures

Arie Tamir. Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. SIAM J. Discrete Math., 1(3):377-396, 1988.

@article{Tamir88,
  title = {Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures},
  author = {Arie Tamir},
  year = {1988},
  researchr = {https://researchr.org/publication/Tamir88},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Discrete Math.},
  volume = {1},
  number = {3},
  pages = {377-396},
}