Related papers: Optimal Electrical Oblivious Routing on Expanders
We study shortest-path routing in large weighted, undirected graphs, where expanding search frontiers raise time and memory costs for exact solvers. We propose \emph{SPHERE}, a query-aware partitioning heuristic that adaptively splits the…
In this paper, we consider the optimal power flow (OPF) problem which consists in determining the power production at each bus of an electric network by minimizing the production cost. Our contribution is an exact solution algorithm for the…
We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at…
The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly,…
Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=... <= \lambda_n <= 2 be the eigenvalues of the normalized Laplacian matrix of G. We prove that for any graph G and any k >= 2, \phi(G) =…
We present new quantum algorithms for Triangle Finding improving its best previously known quantum query complexities for both dense and spare instances.For dense graphs on $n$ vertices, we get a query complexity of $O(n^{5/4})$ without any…
Computing optimal transport (OT) for general high-dimensional data has been a long-standing challenge. Despite much progress, most of the efforts including neural network methods have been focused on the static formulation of the OT…
We present an algorithm for computing $s$-$t$ maximum flows in directed graphs in $\widetilde{O}(m^{4/3+o(1)}U^{1/3})$ time. Our algorithm is inspired by potential reduction interior point methods for linear programming. Instead of using…
In this paper, we develop a distributionally robust chance-constrained formulation of the Optimal Power Flow problem (OPF) whereby the system operator can leverage contextual information. For this purpose, we exploit an ambiguity set based…
For a reduction in environmental pollution and dependency on petroleum, electric vehicles (EV) present an advantageous alternative to traditionally fossil-fuel powered automobiles. Rapid growth in the number of EVs requires an urgent need…
We consider the problem of constructing a single spanning tree for the single-source buy-at-bulk network design problem for doubling-dimension graphs. We compute a spanning tree to route a set of demands (or data) along a graph to or from a…
We propose a hierarchical distributed algorithm to solve optimal power flow (OPF) problems that aim at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features…
There is a recent exciting line of work in distributed graph algorithms in the $\mathsf{CONGEST}$ model that exploit expanders. All these algorithms so far are based on two tools: expander decomposition and expander routing. An…
Optimal experimental design (OED) concerns itself with identifying ideal methods of data collection, e.g.~via sensor placement. The \emph{greedy algorithm}, that is, placing one sensor at a time, in an iteratively optimal manner, stands as…
Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the…
Recent works on optical flow estimation use neural networks to predict the flow field that maps positions of one image to positions of the other. These networks consist of a feature extractor, a correlation volume, and finally several…
Pure electric vehicles (PEVs) are increasingly adopted to decarbonize the transport sector and mitigate global warming. However, the inadequate PEV charging infrastructure may hinder the further adoption of PEVs in the large-scale traffic…
We provide an algorithm which, with high probability, maintains a $(1-\epsilon)$-approximate maximum flow on an undirected graph undergoing $m$-edge additions in amortized $m^{o(1)} \epsilon^{-3}$ time per update. To obtain this result, we…
The beam energy dependence of the elliptic flow,$v_2$, is studied in mid-central Au+Au collisions in the energy range of $3\leq \sqrt{s_{NN}} \leq 30$ GeV within the microscopic transport model JAM. The results of three different modes of…
Electric vehicles (EVs) play a significant role in enhancing the sustainability of transportation systems. However, their widespread adoption is hindered by inadequate public charging infrastructure, particularly to support long-distance…