Pages that link to "Item:Q5189513"
From MaRDI portal
The following pages link to Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (Q5189513):
Displaying 14 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Overcoming controllability problems in distributed testing from an input output transition system (Q1938361) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- A novel local search algorithm with configuration checking and scoring mechanism for the set <i>k</i>‐covering problem (Q4601636) (← links)
- (Q4691855) (← links)
- Efficient Design of Compact Unstructured RNA Libraries Covering All k-mers (Q5283834) (← links)
- Parameterized and Exact Computation (Q5311519) (← links)
- A local search algorithm for the \(k\)-path partition problem (Q6181375) (← links)
