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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.