Pages that link to "Item:Q1588828"
From MaRDI portal
The following pages link to Master-slave strategy and polynomial approximation (Q1588828):
Displaying 6 items.
- A note on the clustered set covering problem (Q496643) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Approximation of the clustered set covering problem (Q2883599) (← links)