Streaming Verification of Graph Properties
Abstract
Streaming interactive proofs (SIPs) are a framework for outsourced computation. A computationally limited streaming client (the verifier) hands over a large data set to an untrusted server (the prover) in the cloud and the two parties run a protocol to confirm the correctness of result with high probability. SIPs are particularly interesting for problems that are hard to solve (or even approximate) well in a streaming setting. The most notable of these problems is finding maximum matchings, which has received intense interest in recent years but has strong lower bounds even for constant factor approximations. In this paper, we present efficient streaming interactive proofs that can verify maximum matchings exactly. Our results cover all flavors of matchings (bipartite/non-bipartite and weighted). In addition, we also present streaming verifiers for approximate metric TSP. In particular, these are the first efficient results for weighted matchings and for metric TSP in any streaming verification model.
Cite
@article{arxiv.1602.08162,
title = {Streaming Verification of Graph Properties},
author = {Amirali Abdullah and Samira Daruki and Chitradeep Dutta Roy and Suresh Venkatasubramanian},
journal= {arXiv preprint arXiv:1602.08162},
year = {2016}
}
Comments
26 pages, 2 figure, 1 table