Speeding up Dynamic Programming in the Line-Constrained k-median
From MaRDI portal
Publication:2819512
DOI10.1007/978-3-319-44543-4_23zbMath1391.90374OpenAlexW2540413266MaRDI QIDQ2819512
Łukasz Zatorski, Paweł Gawrychowski
Publication date: 29 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44543-4_23
Cites Work
- Unnamed Item
- A linear-time algorithm for concave one-dimensional dynamic programming
- Geometric applications of a matrix-searching algorithm
- The algebraic degree of geometric optimization problems
- Time bounds for selection
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
- Space-Efficient Data-Analysis Queries on Grids
- On the Complexity of Some Common Geometric Location Problems
- Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property