Tamás Király, Lap Chi Lau. Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings. pages 283-292, IEEE Computer Society, 2006. [doi]
@inproceedings{KiralyL06,
title = {Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs},
author = {Tamás Király and Lap Chi Lau},
year = {2006},
doi = {10.1109/FOCS.2006.12},
url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.12},
researchr = {https://researchr.org/publication/KiralyL06},
cites = {0},
citedby = {0},
pages = {283-292},
booktitle = {47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-2720-5},
}