Maximum marking problems with accumulative weight functions

Authors:
Isao Sasano;Mizuhito Ogawa;Zhenjiang Hu
Affiliations:
RIEC, Tohoku University, Sendai, Japan;School of Information Science, JAIST, Ishikawa, Japan;Department of Mathematical Informatics, School of Information Science and Technology, University of Tokyo, Tokyo, Japan
Venue:
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Year:
2005

Citing 11
Cited 2

Linear-time computation of optimal subgraphs of decomposable graphs

Journal of Algorithms
An introduction to the theory of lists

Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
Algebraic identities for program calculation

The Computer Journal - Special issue on Lazy functional programming
The maximum-segment-sum problem

Formal development programs and proofs
Rules and strategies for transforming functional and logic programs

ACM Computing Surveys (CSUR)
Algebra of programming

Algebra of programming
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Introduction to Functional Programming

Introduction to Functional Programming
Iterative-free program analysis

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Maximum marking problems

Journal of Functional Programming
Generation of efficient programs for solving maximum multi-marking problems

SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation

Synthesis of fast programs for maximum segment sum problems

GPCE '09 Proceedings of the eighth international conference on Generative programming and component engineering
A Short Cut to Optimal Sequences

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

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.