Login / Signup

Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees.

Bishnu BhattacharyyaFrank K. H. A. Dehne
Published in: Inf. Process. Lett. (2008)
Keyphrases
  • decision trees
  • shortest path
  • lagrange multipliers
  • tree construction
  • information systems
  • relational databases
  • mathematical programming
  • fixed length