@inproceedings{8dea6fb708d74273acd2033da24e714c,
title = "Greedy Universal Cycle Constructions for Weak Orders",
abstract = "A weak order is a way to rank n objects where ties are allowed. In this paper, we extend the prefer-larger and the prefer-opposite algorithms for de Bruijn sequences to provide the first known greedy universal cycle constructions for weak orders.",
keywords = "Greedy algorithm, Prefer-larger, Prefer-opposite, Universal cycle, Weak orders",
author = "Marsden Jacques and Dennis Wong",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020 ; Conference date: 13-02-2020 Through 15-02-2020",
year = "2020",
doi = "10.1007/978-3-030-39219-2_29",
language = "English",
isbn = "9783030392185",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "363--370",
editor = "Manoj Changat and Sandip Das",
booktitle = "Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings",
address = "Germany",
}