English

Approximation Algorithms for Probabilistic Graphs

Data Structures and Algorithms 2018-07-10 v2 Networking and Internet Architecture
Authors: Kai Han
View on arXiv ↗ PDF ↗

Abstract

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.

Keywords

graph matching graph algorithms approximation algorithm

Cite

@article{arxiv.1807.01191,
  title  = {Approximation Algorithms for Probabilistic Graphs},
  author = {Kai Han},
  journal= {arXiv preprint arXiv:1807.01191},
  year   = {2018}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Approximation algorithms for k-median problems on complex networks: theory and practice
Roldan Pozo
2023-12-14
Data Structures and Algorithms · Computer Science
Dynamic algorithms for k-center on graphs
Emilio Cruciani, Sebastian Forster, Gramoz Goranci, Yasamin Nazari +1
2024-01-10
Data Structures and Algorithms · Computer Science
The k-Center Problem of Uncertain Points on Graphs
Haitao Xu, Jingru Zhang
2025-12-22
Data Structures and Algorithms · Computer Science
Stochastic Combinatorial Optimization under Probabilistic Constraints
Shipra Agrawal, Amin Saberi, Yinyu Ye
2008-09-03
Data Structures and Algorithms · Computer Science
A Constant Approximation for Colorful k-Center
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi Varadarajan
2019-07-23
Computational Complexity · Computer Science
The Hardness of Approximation of Euclidean k-means
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, Ali Kemal Sinop
2015-02-12
Data Structures and Algorithms · Computer Science
An improved approximation algorithm for k-median problem using a new factor-revealing LP
Chenchen Wu, Dachuan Xu, Donglei Du, Yishui Wang
2015-09-23
Data Structures and Algorithms · Computer Science
Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
2026-04-16
Computational Complexity · Computer Science
The Parameterized Hardness of the k-Center Problem in Transportation Networks
Andreas Emil Feldmann, Daniel Marx
2020-03-03
Data Structures and Algorithms · Computer Science
Approximating optimization problems in graphs with locational uncertainty
Marin Bougeret, Jérémy Omer, Michael Poss
2024-12-25
Data Structures and Algorithms · Computer Science
An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem
Shanfei Li
2014-06-18
Data Structures and Algorithms · Computer Science
Top-k Overlapping Densest Subgraphs: Approximation and Complexity
Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis
2019-01-31
Distributed, Parallel, and Cluster Computing · Computer Science
$k$-Center Clustering in Distributed Models
Leyla Biabani, Ami Paz
2024-07-26
Artificial Intelligence · Computer Science
Elkan's k-Means for Graphs
Brijnesh J. Jain, Klaus Obermayer
2009-12-24
Data Structures and Algorithms · Computer Science
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
Andreas Emil Feldmann
2019-04-29
Data Structures and Algorithms · Computer Science
Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics
Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu
2016-04-08
Data Structures and Algorithms · Computer Science
A 3-Approximation Algorithm for a Particular Case of the Hamiltonian p-Median Problem
Dilson Lucas Pereira, Michel Wan Der Maas Soares
2022-04-28
Data Structures and Algorithms · Computer Science
On the Fixed-Parameter Tractability of Capacitated Clustering
Vincent Cohen-Addad, Jason Li
2022-08-31
Data Structures and Algorithms · Computer Science
New Approximation Algorithms for Forest Closeness Centrality -- for Individual Vertices and Vertex Groups
Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke
2021-01-18
Data Structures and Algorithms · Computer Science
Tight FPT Approximations for $k$-Median and $k$-Means
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee +1
2019-04-30
Data Structures and Algorithms · Computer Science
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, Pasin Manurangsi
2020-06-09
Data Structures and Algorithms · Computer Science
New Approximation Algorithms for Fair $k$-median Problem
Di Wu, Qilong Feng, Jianxin Wang
2022-02-15
Multiagent Systems · Computer Science
Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs
Noam Hazon, Mira Gonen, Max Kleb
2015-09-29
Data Structures and Algorithms · Computer Science
A Subquadratic Time Algorithm for the Weighted $k$-Center Problem on Cactus Graphs
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2023-03-31
Data Structures and Algorithms · Computer Science
Parameterized Approximation Schemes using Graph Widths
Michael Lampis
2014-02-18