Database Paper Browser

Back to papers

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)

Paper ID
5067
Venue
SIGMOD
Year
2015
Pagerank
5.847257e-05
Overall Rank
6,727 | 53.25%
DOI
10.1145/2723372.2749449

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

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
202 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00025608916
280 Online Search of Overlapping Communities 2013 SIGMOD 0.00022555429
288 Local Search of Communities in Large Graphs 2014 SIGMOD 0.00022437469
1,425 Fast and Exact Top-k Search for Random Walk with Restart 2012 VLDB 0.00010918564
5,781 Reverse Top-k Search using Random Walk with Restart 2014 VLDB 6.1532882e-05
Previous Page 1 / 1 Next

Semantically Similar Papers