Carl-Christian Kanne, Guido Moerkotte. A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix. In Umeshwar Dayal, Kyu-Young Whang, David B. Lomet, Gustavo Alonso, Guy M. Lohman, Martin L. Kersten, Sang Kyun Cha, Young-Kuk Kim, editors, Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006. pages 91-102, ACM, 2006. [doi]
@inproceedings{KanneM06, title = {A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix}, author = {Carl-Christian Kanne and Guido Moerkotte}, year = {2006}, url = {http://www.vldb.org/conf/2006/p91-kanne.pdf}, tags = {partitioning}, researchr = {https://researchr.org/publication/KanneM06}, cites = {0}, citedby = {0}, pages = {91-102}, booktitle = {Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006}, editor = {Umeshwar Dayal and Kyu-Young Whang and David B. Lomet and Gustavo Alonso and Guy M. Lohman and Martin L. Kersten and Sang Kyun Cha and Young-Kuk Kim}, publisher = {ACM}, isbn = {1-59593-385-9}, }