π
π
The Cartographer
Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs
June 09, 2023 Β· Declared Dead Β· π International Symposium on Networks, Computers and Communications
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Javad B. Ebrahimi, Alireza Tofighi Mohammadi, Fatemeh Kermani
arXiv ID
2306.05916
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CR
Citations
1
Venue
International Symposium on Networks, Computers and Communications
Last Checked
4 months ago
Abstract
In this paper, we present a polynomial time algorithm for the problem of differentially private all pair shortest distances over the class of low tree-width graphs. Our result generalizes the result of Sealfon 2016 for the case of trees to a much larger family of graphs. Furthermore, if we restrict to the class of low tree-width graphs, the additive error of our algorithm is significantly smaller than that of the best known algorithm for this problem, proposed by Chen et. al. 2023.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted