Suchergebnisse - "LP rounding algorithms"

Centrality of trees for capacitated k-center von An, Hyung-Chan, Bhaskara, Aditya, Chekuri, Chandra, Gupta, Shalmoli, Madan, Vivek, Svensson, Ola

“… We consider the capacitated k -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated …”
Volltext

An approximation algorithm for the k-generalized Steiner forest problem von Gao, Jiawen, Gao, Suogang, Liu, Wen, Wu, Weili, Du, Ding-Zhu, Hou, Bo

“… In this paper, we introduce the k -generalized Steiner forest ( k -GSF) problem, which is a natural generalization of the k -Steiner forest problem and the …”
Volltext

LP-based pivoting algorithm for higher-order correlation clustering von Fukunaga, Takuro

“… Correlation clustering is an approach for clustering a set of objects from given pairwise information. In this approach, the given pairwise information is …”
Volltext

An improved per-scenario bound for the two-stage stochastic facility location problem von Wu, ChenChen, Du, DongLei, Xu, DaChuan

“… We study the two-stage stochastic facility location problem （2-SFLP） by proposing an LP （location problem）-rounding approximation algorithm with 2.3613 …”
Volltext