11,233 research outputs found
Improved approximation guarantees for weighted matching in the semi-streaming model
We study the maximum weight matching problem in the semi-streaming model, and
improve on the currently best one-pass algorithm due to Zelke (Proc. of
STACS2008, pages 669-680) by devising a deterministic approach whose
performance guarantee is 4.91+epsilon. In addition, we study preemptive online
algorithms, a sub-class of one-pass algorithms where we are only allowed to
maintain a feasible matching in memory at any point in time. All known results
prior to Zelke's belong to this sub-class. We provide a lower bound of 4.967 on
the competitive ratio of any such deterministic algorithm, and hence show that
future improvements will have to store in memory a set of edges which is not
necessarily a feasible matching
Scalable Auction Algorithms for Bipartite Maximum Matching Problems
In this paper, we give new auction algorithms for maximum weighted bipartite
matching (MWM) and maximum cardinality bipartite -matching (MCbM). Our
algorithms run in and rounds, respectively, in the blackboard distributed
setting. We show that our MWM algorithm can be implemented in the distributed,
interactive setting using and bit messages,
respectively, directly answering the open question posed by Demange, Gale and
Sotomayor [DNO14]. Furthermore, we implement our algorithms in a variety of
other models including the the semi-streaming model, the shared-memory
work-depth model, and the massively parallel computation model. Our
semi-streaming MWM algorithm uses passes in space and our MCbM algorithm runs in
passes using space (where parameters represent
the degree constraints on the -matching and and represent the left
and right side of the bipartite graph, respectively). Both of these algorithms
improves \emph{exponentially} the dependence on in the space
complexity in the semi-streaming model against the best-known algorithms for
these problems, in addition to improvements in round complexity for MCbM.
Finally, our algorithms eliminate the large polylogarithmic dependence on
in depth and number of rounds in the work-depth and massively parallel
computation models, respectively, improving on previous results which have
large polylogarithmic dependence on (and exponential dependence on
in the MPC model).Comment: To appear in APPROX 202
Semi-Streaming Set Cover
This paper studies the set cover problem under the semi-streaming model. The
underlying set system is formalized in terms of a hypergraph whose
edges arrive one-by-one and the goal is to construct an edge cover with the objective of minimizing the cardinality (or cost in the weighted
case) of . We consider a parameterized relaxation of this problem, where
given some , the goal is to construct an edge -cover, namely, a subset of edges incident to all but an
-fraction of the vertices (or their benefit in the weighted case).
The key limitation imposed on the algorithm is that its space is limited to
(poly)logarithmically many bits per vertex.
Our main result is an asymptotically tight trade-off between and
the approximation ratio: We design a semi-streaming algorithm that on input
graph , constructs a succinct data structure such that for
every , an edge -cover that approximates
the optimal edge \mbox{(-)cover} within a factor of can be
extracted from (efficiently and with no additional space
requirements), where In particular for the traditional
set cover problem we obtain an -approximation. This algorithm is
proved to be best possible by establishing a family (parameterized by
) of matching lower bounds.Comment: Full version of the extended abstract that will appear in Proceedings
of ICALP 2014 track
Maximum Weight b-Matchings in Random-Order Streams
We consider the maximum weight -matching problem in the random-order
semi-streaming model. Assuming all weights are small integers drawn from
, we present a approximation algorithm,
using a memory of ,
where denotes the cardinality of the optimal matching. Our result
generalizes that of Bernstein [Bernstein, 2015], which achieves a approximation for the maximum cardinality simple matching. When
is small, our result also improves upon that of Gamlath et al. [Gamlath et
al., 2019], which obtains a approximation (for some small constant
) for the maximum weight simple matching. In particular,
for the weighted -matching problem, ours is the first result beating the
approximation ratio of . Our technique hinges on a generalized weighted
version of edge-degree constrained subgraphs, originally developed by Bernstein
and Stein [Bernstein and Stein, 2015]. Such a subgraph has bounded vertex
degree (hence uses only a small number of edges), and can be easily computed.
The fact that it contains a approximation of
the maximum weight matching is proved using the classical
K\H{o}nig-Egerv\'ary's duality theorem
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
In this paper, we study linear programming based approaches to the maximum
matching problem in the semi-streaming model. The semi-streaming model has
gained attention as a model for processing massive graphs as the importance of
such graphs has increased. This is a model where edges are streamed-in in an
adversarial order and we are allowed a space proportional to the number of
vertices in a graph.
In recent years, there has been several new results in this semi-streaming
model. However broad techniques such as linear programming have not been
adapted to this model. We present several techniques to adapt and optimize
linear programming based approaches in the semi-streaming model with an
application to the maximum matching problem. As a consequence, we improve
(almost) all previous results on this problem, and also prove new results on
interesting variants
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 space which also
extends to weighted matching. Using previous results by Kapralov, Khanna, and
Sudan (2014) we obtain a approximation for general graphs
using space in random order streams, respectively. In
addition, we give a space lower bound of for any
randomized algorithm estimating the size of a maximum matching up to a
factor for adversarial streams
Streaming Verification of Graph Properties
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.Comment: 26 pages, 2 figure, 1 tabl
- …