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]

Abstract

Abstract is missing.