The Minimum Wiener Connector Problem
Summary: Defines the Minimum Wiener Connector problem: find a subgraph that connects Q with minimum Wiener index. Shows NP-hardness (no PTAS unless P=NP); presents a constant-factor O(|Q||E|) approximation (polylog factors) and an exact algorithm for bounded |Q|, with experiments confirming smaller, denser solutions by adding a few high-centrality vertices. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Natali Ruchansky (Boston University)
- 2. Francesco Bonchi (Yahoo)
- 3. David García-Soriano (Yahoo)
- 4. Francesco Gullo (Yahoo)
- 5. Nicolas Kourtellis (Yahoo)
BibTeX Citation
@inproceedings{ruchansky_sigmod15,
title = {{The Minimum Wiener Connector Problem}},
author = {Ruchansky, Natali and Bonchi, Francesco and García-Soriano, David and Gullo, Francesco and Kourtellis, Nicolas},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2749449},
url = {https://dl.acm.org/doi/10.1145/2723372.2749449},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,640 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010153865 |
| 5,087 | Discovering Polarization Niches via Dense Subgraphs with Attractors and Repulsers | 2022 | VLDB | 6.3674344e-05 |
| 6,156 | QTCS: Efficient Query-Centered Temporal Community Search | 2024 | VLDB | 5.9560993e-05 |
| 6,200 | New Trends on Exploratory Methods for Data Analytics | 2017 | VLDB | 5.9457282e-05 |
| 8,358 | Exploring the Data Wilderness through Examples | 2019 | SIGMOD | 5.4446041e-05 |
| 9,691 | A Flexible Framework for Query-oriented Interactive Community Search | 2025 | VLDB | 5.2351259e-05 |
| 10,280 | Periodic Community Search in Temporal Graphs: Time Series-based Methods | 2026 | SIGMOD | 5.093636e-05 |
| 11,085 | Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 273 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022671795 |
| 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022620623 |
| 1,414 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB | 0.00010848387 |
| 5,815 | Reverse Top-k Search using Random Walk with Restart | 2014 | VLDB | 6.0777346e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,522 | The Complexity of Mining Maximal Frequent Subgraphs | 2013 | PODS |
| 2 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 3 | 3,559 | Efficient and Effective Algorithms for Clustering Uncertain Graphs | 2019 | VLDB |
| 4 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 5 | 9,032 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB |
| 6 | 11,691 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB |
| 7 | 7,578 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB |
| 8 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 9 | 4,498 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB |
| 10 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |