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
Volume3722 LNCS
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005 - Hanoi
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Specifications

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Sasano, I., Ogawa, M., & Hu, Z. (2005). Maximum marking problems with accumulative weight functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3722 LNCS, pp. 562-578). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3722 LNCS). https://doi.org/10.1007/11560647_37

Maximum marking problems with accumulative weight functions. / Sasano, Isao; Ogawa, Mizuhito; Hu, Zhenjiang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3722 LNCS 2005. p. 562-578 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3722 LNCS).

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

Sasano, I, Ogawa, M & Hu, Z 2005, Maximum marking problems with accumulative weight functions. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3722 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3722 LNCS, pp. 562-578, 2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005, Hanoi, 05/10/17. https://doi.org/10.1007/11560647_37
Sasano I, Ogawa M, Hu Z. Maximum marking problems with accumulative weight functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3722 LNCS. 2005. p. 562-578. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11560647_37
Sasano, Isao ; Ogawa, Mizuhito ; Hu, Zhenjiang. / Maximum marking problems with accumulative weight functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3722 LNCS 2005. pp. 562-578 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{53a36f59b05448b48d2327145657ad93,
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.",
keywords = "Accumulative weight function, Maximum marking problem, Optimization problem, Program derivation",
author = "Isao Sasano and Mizuhito Ogawa and Zhenjiang Hu",
year = "2005",
doi = "10.1007/11560647_37",
language = "English",
isbn = "3540291075",
volume = "3722 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "562--578",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Maximum marking problems with accumulative weight functions

AU - Sasano, Isao

AU - Ogawa, Mizuhito

AU - Hu, Zhenjiang

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Accumulative weight function

KW - Maximum marking problem

KW - Optimization problem

KW - Program derivation

UR - http://www.scopus.com/inward/record.url?scp=33646409556&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646409556&partnerID=8YFLogxK

U2 - 10.1007/11560647_37

DO - 10.1007/11560647_37

M3 - Conference contribution

AN - SCOPUS:33646409556

SN - 3540291075

SN - 9783540291077

VL - 3722 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 562

EP - 578

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -