k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler

Ovidiu Daescu, Hemant Malik. k-Maximum Subarrays for Small k: Divide-and-Conquer Made Simpler. In Ilias Kotsireas, Panos M. Pardalos, Konstantinos E. Parsopoulos, Dimitris Souravlias, Arsenis Tsokas, editors, Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers. Volume 11544 of Lecture Notes in Computer Science, pages 454-472, Springer, 2019. [doi]

Abstract

Abstract is missing.