Maximum Marking Problems with Accumulative Weight Functions

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.

• Type: Conference
• Year: 2005
• Where: ICTAC
• Authors: Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu
• Keywords: ICTAC 2005, Maximum Marking Problems, Optimization Problems, Weight Functions