The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms

Harold N. Gabow, Seth Pettie. The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. In Martti Penttonen, Erik Meineche Schmidt, editors, Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings. Volume 2368 of Lecture Notes in Computer Science, pages 190-199, Springer, 2002. [doi]

@inproceedings{GabowP02,
  title = {The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms},
  author = {Harold N. Gabow and Seth Pettie},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2368/23680190.htm},
  researchr = {https://researchr.org/publication/GabowP02},
  cites = {0},
  citedby = {0},
  pages = {190-199},
  booktitle = {Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings},
  editor = {Martti Penttonen and Erik Meineche Schmidt},
  volume = {2368},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43866-1},
}