Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches

  title={Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches},
  author={Sepehr Assadi and Sanjeev Khanna and Yang Li and Val Tannen},
In this paper, we introduce a new model for sublinear algorithms called \emph{dynamic sketching}. In this model, the underlying data is partitioned into a large \emph{static} part and a small \emph{dynamic} part and the goal is to compute a summary of the static part (i.e, a \emph{sketch}) such that given any \emph{update} for the dynamic part, one can combine it with the sketch to compute a given function. We say that a sketch is \emph{compact} if its size is bounded by a polynomial function… 
Vertex Sparsification for Edge Connectivity
The results lead to the first data structures for answering fully dynamic offline $c-edge-connectivity queries for $c \ge 4$ in polylogarithmic time per query, as well as more efficient algorithms for survivable network design on bounded treewidth graphs.
On finding highly connected spanning subgraphs
The connectivity properties of $\lambda$-edge connected (di)graphs are investigated and the first fixed parameter tractable algorithm, and a polynomial kernel for a parameterized version of the classic Mininum Equivalent Graph problem are obtained.
Parameterized Algorithms for Survivable Network Design with Uniform Demands
The first FPT algorithm for the parameterized version of the classical M inimum E quivalent G raph (MEG) problem is obtained and it is shown that λ-VCS is FPT on digraphs; however the problem on undirected graphs remains open.
Preprocessing Under Uncertainty: Matroid Intersection
A positive preprocessing result is presented for the important case of finding a largest common independent set in two linear matroids in the form of a matrix rather than a matrix for the Matroid Intersection problem.
Vertex Sparsifiers for c-Edge Connectivity
The existence of O(f(c)k) sized vertex sparsifiers that preserve all edge-connectivity values up to c between a set of k terminal vertices is shown, which implies that for constant values of c, an offline sequence of edge insertions/deletions and c-edge-Connectivity queries can be answered in polylog time per operation.
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity
This work gives offline algorithms for processing a sequence of 2- and 3-edge and vertex connectivity queries in a fully-dynamic undirected graph using a divide and conquer scheme that transforms a graph into smaller equivalents that preserve connectivity information.
Preprocessing under uncertainty
This work presents efficient algorithms that given an instance with partially uncertain input generate an instance of size polynomial in the amount of uncertain data that is equivalent for every instantiation of the unknown part.
Representative Sets and Irrelevant Vertices
It is shown how representative sets can be used to derive a polynomial kernel for the elusive ALMOST 2-SAT problem, solving a major open problem in kernelization, and the first significant progress towards a Polynomial kernels for the MULTIWAY CUT problem is made.


Vertex Sparsifiers and Abstract Rounding Algorithms
It is shown that any rounding algorithm which also works for the $0$-extension relaxation can be used to construct good vertex-sparsifiers for which the optimization problem is easy, and that for many natural optimization problems, the integrality gap of the linear program is always at most $O(\log k)$ times the integralality gap restricted to trees.
Analyzing graph structure via linear measurements
The study of graph sketching is initiated, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph are studied, including the first dynamic graph semi-streaming algorithms for connectivity, spanning trees, sparsification, and matching problems.
Vertex Sparsifiers: New Results from Old Techniques
Efficient algorithms are given for constructing a flow sparsifier that maintains congestion up to a factor of $O(\frac{\log k}{\log \log k})$ and a convex combination of trees over the terminals of a capacitated graph.
Extensions and limits to vertex sparsification
This work proves that there exist flow sparsifiers that simultaneously preserve the congestion of all multicommodity flows within an O(log k / log log k)-factor where |K| = k and improves to O(1) if G excludes any fixed minor.
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
  • Ankur Moitra
  • Mathematics, Computer Science
    2009 50th Annual IEEE Symposium on Foundations of Computer Science
  • 2009
A more general theory of Steiner cut and flow problems is derived, and bounds that are poly-logarithmic in $k$ for a much broader class of multicommodity flow and cut problems are proved.
Graph sketches: sparsification, spanners, and subgraphs
This work investigates graph sketching where the graphs of interest encode the relationships between these entities and considers properties of graphs including the size of the cuts, the distances between nodes, and the prevalence of dense sub-graphs.
On vertex sparsifiers with Steiner nodes
Algorithms are shown to construct constant-quality cut sparsifier of size O(C3) in time poly(n)• 2C, and constant- quality flow sparsifiers of size CO(log log C) inTime nO(log C)•2C, where C is the total capacity of the edges incident on the terminals.
A parameterized view on matroid optimization problems
  • D. Marx
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2009
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
This work provides the first (randomized) polynomial kernelization for OCT, a novel kernelization approach based on matroid theory, where all relevant information about a problem instance is encoded into a matroid with a representation of size polynomially in k.
On Graph Problems in a Semi-streaming Model
Massive graphs arise naturally in a lot of applications, especially in communication networks like the internet. The size of these graphs makes it very hard or even impossible to store set of edges