Database Paper Browser

Back to papers

Noticeable Network Delay Minimization via Node Upgrades

Summary: Introduces a k-upgrade network design to maximize flows with noticeable delay reductions, prioritizing important nodes. NP-hard, APX-hard, non-submodular; an importance-sampling algorithm with guarantees yields up to 1000x speed-up over greedy and 70x over prior work, validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11800
Venue
VLDB
Year
2018
Pagerank
4.456315e-05
Overall Rank
8,761 | 39.06%
DOI
10.14778/3213880.3213889

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
11,141 Expanding Reverse Nearest Neighbors 2024 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,371 From Competition to Complementarity: Comparative Influence Diffusion and Maximization 2016 VLDB 8.9482922e-05
Previous Page 1 / 1 Next

Semantically Similar Papers