Pages that link to "Item:Q294361"
From MaRDI portal
The following pages link to On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361):
Displaying 4 items.
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces (Q1675324) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)