Before revision:  We model this goal with a regularized edge-based  clustering objective,  design an efficient 2-approximation algorithm for optimizing the NP-hard objective, and provide bounds on hyperparameters to avoid trivial solutions .
After revision:  We model this goal with a regularized edge-based clustering objective, design an efficient 2-approximation algorithm and also show how to compute bounds for the regularization hyperparameter that lead to meaningful diversity-experience tradeoffs .