Pages that link to "Item:Q1334632"
From MaRDI portal
The following pages link to A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632):
Displayed 13 items.
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Hybrid heuristic algorithms for set covering. (Q1406642) (← links)
- A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
- Stock selection heuristics for interdependent items (Q1869495) (← links)
- Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover (Q1944076) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)