The following pages link to Approximating min sum set cover (Q1884768):
Displaying 15 items.
- A note on the generalized min-sum set cover problem (Q408432) (← links)
- A closest vector problem arising in radiation therapy planning (Q411241) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Min-sum bin packing (Q721936) (← links)
- On the distributed complexity of the semi-matching problem (Q736606) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Tight results on minimum entropy set cover (Q926288) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
