Result: Randomized algorithm for the sum selection problem
Title:
Randomized algorithm for the sum selection problem
Authors:
Source:
Algorithms and computation (16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005)0ISAAC 2005. :515-523
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 18 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Méthode cas pire, Worst case method, Método caso peor, Plan randomisé, Randomized design, Plan aleatorizado, Problème sélection, Selection problem, Problema selección
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Tawain, Province of China
ISSN:
0302-9743
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17394426
Database:
PASCAL Archive
Further Information
Given a sequence of n real numbers A = a1, a2..., an and a positive integer k, the SUM SELECTION PROBLEM is to find the segment A(i,j) = ai, ai+1,... aj such that the rank of the sum s(i,j) = Σjt=i at is k over all n(n-1)/2 segments. We will give a randomized algorithm for this problem that runs in expected O(nlogn) time. Applying this algorithm we can obtain an algorithm for the k MAXIMUM SUMS PROBLEM, i.e., the problem of enumerating the k largest sum segments, that runs in expected O(nlogn+k) time. The previously best known algorithm for the k MAXIMUM SUMS PROBLEM runs in O(n log2 n + k) time in the worst case.