Speeding up Dynamic Programming in the Line-Constrained k-median (Q2819512): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic degree of geometric optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for concave one-dimensional dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Data-Analysis Queries on Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property / rank
 
Normal rank

Latest revision as of 14:52, 12 July 2024

scientific article
Language Label Description Also known as
English
Speeding up Dynamic Programming in the Line-Constrained k-median
scientific article

    Statements

    Identifiers