Pages that link to "Item:Q5063275"
From MaRDI portal
The following pages link to Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275):
Displaying 3 items.
- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)