Abstract
In this work, we study the problem of detecting risk-averse low-diameter clusters in graphs. It is assumed that the clusters represent k-clubs and that uncertain information manifests itself in the form of stochastic vertex weights whose joint distribution is known. The goal is to find a k-club of minimum risk contained in the graph. A stochastic programming framework that is based on the formalism of coherent risk measures is used to quantify the risk of a cluster. We show that the selected representation of risk guarantees that the optimal subgraphs are maximal clusters. A combinatorial branch-and-bound algorithm is proposed and its computational performance is compared with an equivalent mathematical programming approach for instances with \(k=2,3,\) and 4.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
