Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68563OpenAlexW4376561447MaRDI QIDQ5716983

Sung Eun Bae, Tadao Takaoka

Publication date: 11 January 2006

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (5)

Ranking \(k\) maximum sums ⋮ 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 ⋮ Optimal algorithms for the average-constrained maximum-sum segment problem ⋮ Improved algorithms for the \(k\) maximum-sums problems

This page was built for publication: Computing and Combinatorics