Abstract
The recently introduced {k}-packing function problem is considered in this paper. Relationship between cases when k = 1, k ≥ 2 and linear programming relaxation are introduced with sufficient conditions for optimality. For arbitrary simple connected graph
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have