Pages that link to "Item:Q3167404"
From MaRDI portal
The following pages link to New and Improved Bounds for the Minimum Set Cover Problem (Q3167404):
Displayed 5 items.
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)