3 papers
cs.CG2025
Balanced TSP partitioning
Benjamin Aram Berendsohn, Hwi Kim, László Kozma
The traveling salesman problem (TSP) famously asks for a shortest tour that a salesperson can take to visit a given set of cities in any order. In this paper, we ask how much faste…
cs.DS2023
Finding the saddlepoint faster than sorting
Justin Dallant, Frederik Haagensen, Riko Jacob +2
A saddlepoint of an matrix is an entry of that is a maximum in its row and a minimum in its column. Knuth (1968) gave several different algorithms for finding…
cs.DS2014
Streaming Algorithms for Partitioning Integer Sequences
Christian Konrad, László Kozma
We study the problem of partitioning integer sequences in the one-pass data streaming model. Given is an input stream of integers of length with m…