Necklaces, Convolutions, and X + Y

DOI10.1007/11841036_17zbMath1131.68580OpenAlexW2104947808MaRDI QIDQ5449525

Timothy M. Chan, Erik D. Demaine, John Iacono, Perouz Taslakian, Jeff Erickson, David Bremner, Stefan Langerman, Ferran Hurtado

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (14)

Extreme Witnesses and Their Applications ⋮ Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ Combining initial segments of lists ⋮ Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis ⋮ Indexing permutations for binary strings ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ Approximating the maximum consecutive subsums of a sequence ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ On approximate jumbled pattern matching in strings ⋮ Techniques and Open Questions in Computational Convex Analysis ⋮ A linear-time algorithm for Hamming distance with shifts ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Optimal point movement for covering circular regions

This page was built for publication: Necklaces, Convolutions, and X + Y