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)
Incoming Non-self Citations Over Time
Authors
- 1. Sourav Medya (University of California Santa Barbara)
- 2. Jithin Vachery (Indian Institute of Technology, Madras)
- 3. Sayan Ranu (Indian Institute of Technology Delhi)
- 4. Ambuj Singh (University of California Santa Barbara)
BibTeX Citation
@article{medya_vldb18,
title = {{Noticeable Network Delay Minimization via Node Upgrades}},
author = {Medya, Sourav and Vachery, Jithin and Ranu, Sayan and Singh, Ambuj},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {9},
pages = {988--1001},
doi = {10.14778/3213880.3213889},
url = {https://doi.org/10.14778/3213880.3213889},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,347 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 5.093636e-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,547 | From Competition to Complementarity: Comparative Influence Diffusion and Maximization | 2016 | VLDB | 8.4331576e-05 |
Previous
Page 1 / 1
Next