Split and Join: Strong Partitions and Universal Steiner Trees for Graphs

Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan. Split and Join: Strong Partitions and Universal Steiner Trees for Graphs. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012. pages 81-90, IEEE Computer Society, 2012. [doi]

@inproceedings{BuschDRRS12,
  title = {Split and Join: Strong Partitions and Universal Steiner Trees for Graphs},
  author = {Costas Busch and Chinmoy Dutta and Jaikumar Radhakrishnan and Rajmohan Rajaraman and Srinivasagopalan Srivathsan},
  year = {2012},
  doi = {10.1109/FOCS.2012.45},
  url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2012.45},
  researchr = {https://researchr.org/publication/BuschDRRS12},
  cites = {0},
  citedby = {0},
  pages = {81-90},
  booktitle = {53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4673-4383-1},
}