Algorithms and Computation

DOI10.1007/11602613zbMath1173.68855OpenAlexW2304246803MaRDI QIDQ5897884

Der-Tsai Lee, Tien-Ching Lin

Publication date: 14 November 2006

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

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

zbMATH Keywords

randomized algorithmcomputational geometryrandom samplingmaximum sum problemorder-statistic treesum selection problem\(k\) maximum sums problemmaximum sum subarray problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Related Items (4)

Fast algorithms for finding disjoint subsequences with extremal densities ⋮ A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ Improved algorithms for the \(k\) maximum-sums problems

This page was built for publication: Algorithms and Computation