Pages that link to "Item:Q2396372"
From MaRDI portal
The following pages link to Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (Q2396372):
Displaying 4 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)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- (Q4880769) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)