Paper Info
Title
Maximum marking problems with accumulative weight functions
Abstract
We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the specification to allow for weight functions with accumulation, which is particularly useful when the weight of each element depends on adjacent elements. This extension of weight functions enables us to treat more interesting optimization problems such as a variant of the maximum segment sum problem and the fair bonus distribution problem. The complexity of the derived algorithm is linear with respect to the size of the input data.
Year
DOI
Venue
2005
10.1007/11560647_37
ICTAC
Keywords
Field
DocType
interesting optimization problem,input data,new derivation,accumulative weight function,fair bonus distribution problem,weight function,optimization problem,maximum segment sum problem,efficient algorithm,adjacent element,program derivation
Mathematical optimization,Weight function,Algorithm complexity,Computer science,Program derivation,Optimization problem
Conference
Volume
ISSN
ISBN
3722
0302-9743
3-540-29107-5
Citations 
PageRank 
References 
3
0.39
10
Authors
3
Name
Order
Citations
PageRank
Isao Sasano1516.18
Mizuhito Ogawa213523.17
Zhenjiang Hu3134199.25