Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
type: Item
instance of: scholarly article
title: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
zbMATH Open document ID: 1112.90012
author: Hoong Chuin Lau
author: Trung Hieu Ngo
author: Bao Nguyen Nguyen
published in: Discrete Optimization
publication date: 2007-02-20T00:00:00Z
full work available at URL: https://ink.library.smu.edu.sg/sis_research/1188
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5128396
zbMATH Keywords: network design
zbMATH Keywords: algorithm
zbMATH Keywords: computational complexity
zbMATH Keywords: logistics
MaRDI profile type: Publication
OpenAlex ID: W2146968241
cites work: An Optimal Algorithm for the Maximum-Density Segment Problem
cites work: Q4410125
cites work: Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
cites work: Linear-time algorithm for finding a maximum-density segment of a sequence
cites work: Finding a length-constrained maximum-density path in a tree
cites work: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
cites work: An efficient algorithm for the length-constrained heaviest path problem on a tree
DOI: 10.1016/J.DISOPT.2006.06.002
description: scientific article; zbMATH DE number 5128396