Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
نویسندگان
چکیده
This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm is implementable in any streaming model including dynamic graph streams. We also give the first constant estimation for the maximum matching size in a dynamic graph stream for planar graphs (or any graph with bounded arboricity) using Õ(n4/5) space which also extends to weighted matching. Using previous results by Kapralov, Khanna, and Sudan (2014) we obtain a polylog(n) approximation for general graphs using polylog(n) space in random order streams, respectively. In addition, we give a space lower bound of Ω(n1−ε) for any randomized algorithm estimating the size of a maximum matching up to a 1 +O(ε) factor for adversarial streams.
منابع مشابه
Fully Dynamic $(1+\epsilon)$-Approximate Matchings
We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is a data structure that maintains a (1 + ǫ) approximation of maximum matching under edge insertions/deletions in worst case O( √ mǫ) time per update. This improves the 3/2 approximation given in [Neiman, Solomon, STOC ...
متن کاملتحلیل حرکت جریانات دریائی در تصاویر حرارتی سطح آب دریا
Oceanographic images obtained from environmental satellites by a wide range of sensors allow characterizing natural phenomena through different physical measurements. For instance Sea Surface Temperature (SST) images, altimetry data and ocean color data can be used for characterizing currents and vortex structures in the ocean. The purpose of this thesis is to derive a relatively complete frame...
متن کاملFinding Graph Matchings in Data Streams
We present algorithms for finding large graph matchings in the streaming model. In this model, applicable when dealing with massive graphs, edges are streamed-in in some arbitrary order rather than residing in randomly accessible memory. For ǫ > 0, we achieve a 1 1+ǫ approximation for maximum cardinality matching and a 1 2+ǫ approximation to maximum weighted matching. Both algorithms use a cons...
متن کاملCamera Pose Estimation in Unknown Environments using a Sequence of Wide-Baseline Monocular Images
In this paper, a feature-based technique for the camera pose estimation in a sequence of wide-baseline images has been proposed. Camera pose estimation is an important issue in many computer vision and robotics applications, such as, augmented reality and visual SLAM. The proposed method can track captured images taken by hand-held camera in room-sized workspaces with maximum scene depth of 3-4...
متن کامل