Open AccessImproved Algorithms for the k Maximum-Sums Problems
Author(s) -
Chih-Huai Cheng,
KuanYu Chen,
Wen-Chin Tien,
KunMao Chao
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/11602613_80
Subject(s) - combinatorics , dimension (graph theory) , order (exchange) , integer (computer science) , mathematics , algorithm , sequence (biology) , computer science , finance , biology , economics , genetics , programming language
Given a sequence of n real numbers and an integer k, 1 ≤ k ≤ 1/2n(n - 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all possible segment sums...
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom