Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics

DOI10.1016/j.disopt.2006.06.002zbMath1112.90012OpenAlexW2146968241MaRDI QIDQ865758

Bao Nguyen Nguyen, Hoong Chuin Lau, Trung Hieu Ngo

Publication date: 20 February 2007

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/1188

zbMATH Keywords

algorithmcomputational complexitynetwork designlogistics

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (7)

Exact and Approximation Algorithms for the Expanding Search Problem ⋮ The density maximization problem in graphs ⋮ Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes ⋮ Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ An improved algorithm for finding a length-constrained maximum-density subtree in a tree ⋮ An optimal algorithm for the maximum-density path in a tree

Cites Work

• An efficient algorithm for the length-constrained heaviest path problem on a tree
• Linear-time algorithm for finding a maximum-density segment of a sequence
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Finding a length-constrained maximum-density path in a tree
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• An Optimal Algorithm for the Maximum-Density Segment Problem
• Unnamed Item

This page was built for publication: Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics