scientific article; zbMATH DE number 2217849

zbMATH Open1073.90502MaRDI QIDQ5699588

Dmitrii D. Lozovanu

Publication date: 26 October 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programming method\(k\)-optimal treepacking knapsack problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time

This page was built for publication: