Pages that link to "Item:Q331987"

The following pages link to Searching for a cycle with maximum coverage in undirected graphs (Q331987):

Displaying 3 items.

• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• On approximating maximum covering cycles in undirected graphs (Q2414126) (← links)