Approximation Algorithms for Probabilistic Graphs

07/03/2018

∙

We study the k-median and k-center problems in probabilistic graphs. We analyze the hardness of these problems, and propose several algorithms with improved approximation ratios compared with the existing proposals.

READ FULL TEXT

Approximation Algorithms for Probabilistic Graphs

Structural Iterative Rounding for Generalized k-Median Problems

Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs

GTApprox: surrogate modeling for industrial design

Constant-Factor Approximation Algorithms for Socially Fair k-Clustering

Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms

Approximation algorithms for stochastic clustering

Approximation Algorithms for Probabilistic Graphs

Related Research

Structural Iterative Rounding for Generalized k-Median Problems

Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs

GTApprox: surrogate modeling for industrial design

Constant-Factor Approximation Algorithms for Socially Fair k-Clustering

Performance evaluation of approximation algorithms for the minimum size 2-vertex strongly connected subgraph problem

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms

Approximation algorithms for stochastic clustering