Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities

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]

Abstract

Abstract is missing.