@InProceedings{hefetz_et_al:LIPIcs.MFCS.2018.35,
author = {Hefetz, Dan and Kupferman, Orna and Lellouche, Amir and Vardi, Gal},
title = {{Spanning-Tree Games}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {35:1--35:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Potapov, Igor and Spirakis, Paul and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.35},
URN = {urn:nbn:de:0030-drops-96171},
doi = {10.4230/LIPIcs.MFCS.2018.35},
annote = {Keywords: Algorithms, Games, Minimum/maximum spanning tree, Greedy algorithms}
}