Abstract the common parts.
Place minterms in a special arrangement so that simplifications can be easily performed.
For each ‘1’ in the K-Map, draw the largest possible group (2, 4, 8)
Using (1), take all groups that cover unique ’1’s
For any remaining ’1’s (not covered by groups in (2)):
Choose the smallest collection of groups to cover all of them.
Find SOP for F’
Negate (1) to get POS.