The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
From MaRDI portal
Publication:2930293
DOI10.1145/1644015.1644032zbMath1298.68073OpenAlexW2622763161MaRDI QIDQ2930293
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1278
No records found.
No records found.
Related Items (5)
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem ⋮ Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks ⋮ Speeding up dynamic programming in the line-constrained \(k\)-median ⋮ Speeding up Dynamic Programming in the Line-Constrained k-median ⋮ Scheduling with gaps: new models and algorithms
This page was built for publication: The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity