Related papers: A node-capacitated Okamura-Seymour theorem
In this paper, we present a general framework for efficiently computing diverse solutions to combinatorial optimization problems. Given a problem instance, the goal is to find $k$ solutions that maximize a specified diversity measure; the…
Dynamic network flows, sometimes called flows over time, extend the notion of network flows to include a transit time for each edge. While Ford and Fulkerson showed that certain dynamic flow problems can be solved via a reduction to static…
We introduce the notion of {\em fair cuts} as an approach to leverage approximate $(s,t)$-mincut (equivalently $(s,t)$-maxflow) algorithms in undirected graphs to obtain near-linear time approximation algorithms for several cut problems.…
We devise the first constant-factor approximation algorithm for finding an integral multi-commodity flow of maximum total value for instances where the supply graph together with the demand edges can be embedded on an orientable surface of…
We consider fully discrete numerical approximations for axisymmetric Willmore flow that are unconditionally stable and work reliably without remeshing. We restrict our attention to surfaces without boundary, but allow for spontaneous…
A fundamental tool in the analysis of Ricci flow is a compactness result of Hamilton in the spirit of the work of Cheeger, Gromov and others. Roughly speaking it allows one to take a sequence of Ricci flows with uniformly bounded curvature…
In this note we reprove a theorem of Gromov using Ricci flow. The theorem states that a, possibly non-constant, lower bound on the scalar curvature is stable under $C^0$-convergence of the metric.
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. This parametric graph template…
This article presents an analysis of the normalized Yamabe flow starting at and preserving a class of compact Riemannian manifolds with incomplete edge singularities and negative Yamabe invariant. Our main results include uniqueness,…
A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…
We study properly immersed ancient solutions of the codimension one mean curvature flow in $n$-dimensional Euclidean space, and classify the convex hulls of the subsets of space reached by any such flow. In particular, it follows that any…
We study a variant of Min Cost Flow in which the flow needs to be connected. Specifically, in the Connected Flow problem one is given a directed graph $G$, along with a set of demand vertices $D \subseteq V(G)$ with demands $\mathsf{dem}: D…
Given a set of source-sink pairs, the maximum multiflow problem asks for the maximum total amount of flow that can be feasibly routed between them. The minimum multicut, a dual problem to multiflow, seeks the minimum-cost set of edges whose…
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given…
In this paper we study the local regularity of closed surfaces immersed in a Riemannian 3-manifold flowing by Willmore flow. We establish a pair of concentration-compactness alternatives for the flow, giving a lower bound on the maximal…
The P\'osa--Seymour conjecture determines the minimum degree threshold for forcing the $k$th power of a Hamilton cycle in a graph. After numerous partial results, Koml\'os, S\'ark\"ozy and Szemer\'edi proved the conjecture for sufficiently…
We study the flow extension of graphs, i.e., pre-assigning a partial flow on the edges incident to a given vertex and aiming to extend to the entire graph. This is closely related to Tutte's $3$-flow conjecture(1972) that every…
By a symmetric double graph we mean a hypersurface which is mirror-symmetric and the two symmetric parts are graphs over the hyperplane of symmetry. We prove that there is a weak solution of mean curvature flow that preserves these…