The following pages link to (Q4411280):
Displaying 16 items.
- A note on the generalized min-sum set cover problem (Q408432) (← links)
- Some algorithmic results for [2]-sumset covers (Q458372) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Approximating min sum set cover (Q1884768) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- The minimum-entropy set cover problem (Q2581268) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2904785) (← links)
- All-Norms and All-L_p-Norms Approximation Algorithms (Q3165959) (← links)
- A threshold of \(\ln n\) for approximating set cover (Q4228484) (← links)
- (Q4843442) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Database Theory - ICDT 2005 (Q5316618) (← links)
- Algorithms and Computation (Q5897901) (← links)
- On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)