Maximum marking problems with accumulative weight functions

Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages562-578
Number of pages17
DOIs
Publication statusPublished - 2005 Dec 1
Externally publishedYes
Event2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005 - Hanoi, Viet Nam
Duration: 2005 Oct 172005 Oct 21

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3722 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005
CountryViet Nam
CityHanoi
Period05/10/1705/10/21

Keywords

  • Accumulative weight function
  • Maximum marking problem
  • Optimization problem
  • Program derivation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Maximum marking problems with accumulative weight functions'. Together they form a unique fingerprint.

Cite this