Sungjin Im, Benjamin Moseley. Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi 0001, Bettina Speckmann, editors, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Volume 9134 of Lecture Notes in Computer Science, pages 737-748, Springer, 2015. [doi]
@inproceedings{ImM15-0,
title = {Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities},
author = {Sungjin Im and Benjamin Moseley},
year = {2015},
doi = {10.1007/978-3-662-47672-7_60},
url = {http://dx.doi.org/10.1007/978-3-662-47672-7_60},
researchr = {https://researchr.org/publication/ImM15-0},
cites = {0},
citedby = {0},
pages = {737-748},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I},
editor = {Magnús M. Halldórsson and Kazuo Iwama and Naoki Kobayashi 0001 and Bettina Speckmann},
volume = {9134},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-47671-0},
}