Pages that link to "Item:Q1944047"
From MaRDI portal
The following pages link to Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047):
Displayed 7 items.
- Revisiting a randomized algorithm for the minimum rainbow subgraph problem (Q501008) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- (Q2857441) (← links)
- The Parameterized Complexity of the Rainbow Subgraph Problem (Q2945198) (← links)