81 research outputs found
New Notions and Constructions of Sparsification for Graphs and Hypergraphs
A sparsifier of a graph (Bencz\'ur and Karger; Spielman and Teng) is a
sparse weighted subgraph that approximately retains the cut
structure of . For general graphs, non-trivial sparsification is possible
only by using weighted graphs in which different edges have different weights.
Even for graphs that admit unweighted sparsifiers, there are no known
polynomial time algorithms that find such unweighted sparsifiers.
We study a weaker notion of sparsification suggested by Oveis Gharan, in
which the number of edges in each cut is not approximated within a
multiplicative factor , but is, instead, approximated up to an
additive term bounded by times , where
is the average degree, and is the sum of the degrees of the
vertices in . We provide a probabilistic polynomial time construction of
such sparsifiers for every graph, and our sparsifiers have a near-optimal
number of edges . We also provide
a deterministic polynomial time construction that constructs sparsifiers with a
weaker property having the optimal number of edges . Our
constructions also satisfy a spectral version of the ``additive
sparsification'' property.
Our construction of ``additive sparsifiers'' with edges also
works for hypergraphs, and provides the first non-trivial notion of
sparsification for hypergraphs achievable with hyperedges when
and the rank of the hyperedges are constant. Finally, we provide
a new construction of spectral hypergraph sparsifiers, according to the
standard definition, with
hyperedges, improving over the previous spectral construction (Soma and
Yoshida) that used hyperedges even for constant and
.Comment: 31 page
New Notions and Constructions of Sparsification for Graphs and Hypergraphs
A sparsifier of a graph G (Benczu´r and Karger; Spielman and Teng) is a sparse weighted subgraph ˜ G that approximately retains the same cut structure of G. For general graphs, non-trivial sparsification is possible only by using weighted graphs in which different edges have different weights. Even for graphs that admit unweighted sparsifiers (that is, sparsifiers in which all the edge weights are equal to the same scaling factor), there are no known polynomial time algorithms that find such unweighted sparsifiers. We study a weaker notion of sparsification suggested by Oveis Gharan, in which the number of cut edges in each cut (S, ¯ S) is not approximated within a multiplicative factor (1 + ǫ), but is, instead, approximated up to an additive term bounded by ǫ times d · |S| + vol(S), where d is the average
New notions and constructions of sparsification for graphs and hypergraphs
No abstract availabl
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries
The problem of sparsifying a graph or a hypergraph while approximately
preserving its cut structure has been extensively studied and has many
applications. In a seminal work, Bencz\'ur and Karger (1996) showed that given
any -vertex undirected weighted graph and a parameter , there is a near-linear time algorithm that outputs a weighted subgraph
of of size such that the weight of every
cut in is preserved to within a -factor in . The
graph is referred to as a {\em -approximate cut
sparsifier} of . Subsequent recent work has obtained a similar result for
the more general problem of hypergraph cut sparsifiers. However, all known
sparsification algorithms require time where denotes the
number of vertices and denotes the number of hyperedges in the hypergraph.
Since can be exponentially large in , a natural question is if it is
possible to create a hypergraph cut sparsifier in time polynomial in , {\em
independent of the number of edges}. We resolve this question in the
affirmative, giving the first sublinear time algorithm for this problem, given
appropriate query access to the hypergraph.Comment: ICALP 202
Vertex Sparsifiers for Hyperedge Connectivity
Recently, Chalermsook et al. [SODA'21(arXiv:2007.07862)] introduces a notion
of vertex sparsifiers for -edge connectivity, which has found applications
in parameterized algorithms for network design and also led to exciting dynamic
algorithms for -edge st-connectivity [Jin and Sun
FOCS'21(arXiv:2004.07650)]. We study a natural extension called vertex
sparsifiers for -hyperedge connectivity and construct a sparsifier whose
size matches the state-of-the-art for normal graphs. More specifically, we show
that, given a hypergraph with vertices and hyperedges with
terminal vertices and a parameter , there exists a hypergraph
containing only hyperedges that preserves all minimum cuts (up to
value ) between all subset of terminals. This matches the best bound of
edges for normal graphs by [Liu'20(arXiv:2011.15101)]. Moreover,
can be constructed in almost-linear time where is the rank of and
is the total size of , or in time if we slightly relax
the size to hyperedges.Comment: submitted to ESA 202
Cut Sparsification and Succinct Representation of Submodular Hypergraphs
In cut sparsification, all cuts of a hypergraph are approximated
within factor by a small hypergraph . This widely applied
method was generalized recently to a setting where the cost of cutting each
is provided by a splitting function, . This
generalization is called a submodular hypergraph when the functions
are submodular, and it arises in machine learning,
combinatorial optimization, and algorithmic game theory. Previous work focused
on the setting where is a reweighted sub-hypergraph of , and measured
size by the number of hyperedges in . We study such sparsification, and
also a more general notion of representing succinctly, where size is
measured in bits.
In the sparsification setting, where size is the number of hyperedges, we
present three results: (i) all submodular hypergraphs admit sparsifiers of size
polynomial in ; (ii) monotone-submodular hypergraphs admit sparsifiers
of size ; and (iii) we propose a new parameter, called
spread, to obtain even smaller sparsifiers in some cases.
In the succinct-representation setting, we show that a natural family of
splitting functions admits a succinct representation of much smaller size than
via reweighted subgraphs (almost by factor ). This large gap is surprising
because for graphs, the most succinct representation is attained by reweighted
subgraphs. Along the way, we introduce the notion of deformation, where
is decomposed into a sum of functions of small description, and we provide
upper and lower bounds for deformation of common splitting functions
- …