Pages that link to "Item:Q2414126"
From MaRDI portal
The following pages link to On approximating maximum covering cycles in undirected graphs (Q2414126):
Displaying 8 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)
- 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)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Covering tours and cycle covers with turn costs: hardness and approximation (Q2294052) (← links)
- Approximating maximum weight cycle covers in directed graphs with weights zero and one (Q2483998) (← links)
- (Q3032292) (← links)
- On Approximating Restricted Cycle Covers (Q3614154) (← links)