Related papers: Disjoint optimizers and the directed landscape
A reparametrization (of a continuous path) is given by a surjective weakly increasing self-map of the unit interval. We show that the monoid of reparametrizations (with respect to compositions) can be understood via ``stop-maps'' that allow…
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…
We consider several basic questions on distributed routing in directed graphs with multiple additive costs, or metrics, and multiple constraints. Distributed routing in this sense is used in several protocols, such as IS-IS and OSPF. A…
We propose a distributed version of the Alternating Direction Method of Multipliers (ADMM) with linear updates for directed networks. We show that if the objective function of the minimization problem is smooth and strongly convex, our…
Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based…
As a common generalization of previously solved optimization problems concerning bipartite stable matchings, we describe a strongly polynomial network flow based algorithm for computing $\ell$ disjoint stable matchings with minimum total…
The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some…
A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…
The directed landscape constructed in (Dauvergne-Ortmann-Virag '18) produces a directed, planar, random geometry, and is believed to be the universal scaling limit of two-dimensional first and last passage percolation models in the…
The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar…
Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…
We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…
We investigate the long-time behavior of the Airy wanderer line ensembles, an infinite-parameter family of Brownian Gibbsian line ensembles arising as edge-scaling limits of inhomogeneous models in the Kardar--Parisi--Zhang universality…
We propose a deterministic adjoint matching framework that formulates human preference alignment for flow-based generative models as an optimal control problem over velocity fields. One can directly regress the control toward a…
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint…
We consider $(1+1)$-dimensional directed polymers in a random potential and provide sufficient conditions guaranteeing joint localization. Joint localization means that for typical realizations of the environment, and for polymers started…
Many applications require solving sequences of related mixed-integer linear programs. We introduce a class of parametric disjunctive inequalities (PDIs), obtained by reusing the disjunctive proofs of optimality from prior solves to…
The purpose of this paper is to prove that every finite set of points that can be constructed in the Euclidean plane by using a compass and a ruler can also be constructed by using unitary match-sticks in a non-simultaneous way and…
The parabolic Airy line ensemble $\mathfrak A$ is a central limit object in the KPZ universality class and related areas. On any compact set $K = \{1, \dots, k\} \times [a, a + t]$, the law of the recentered ensemble $\mathfrak A -…
The geometric constraints of Zhou et al. (2015) are a widely used technique in topology/freeform optimization to impose minimum lengthscales for manufacturability. However, its efficacy degrades as design binarization is increased, and it…