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]

Authors

Costas Busch

This author has not been identified. Look up 'Costas Busch' in Google

Chinmoy Dutta

This author has not been identified. Look up 'Chinmoy Dutta' in Google

Jaikumar Radhakrishnan

This author has not been identified. Look up 'Jaikumar Radhakrishnan' in Google

Rajmohan Rajaraman

This author has not been identified. Look up 'Rajmohan Rajaraman' in Google

Srinivasagopalan Srivathsan

This author has not been identified. Look up 'Srinivasagopalan Srivathsan' in Google