Pages that link to "Item:Q865758"

The following pages link to Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758):

Displaying 7 items.

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