Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Schild, Aaron"'
Autor:
Karntikoon, Kritkorn, Shen, Yiheng, Gollapudi, Sreenivas, Kollias, Kostas, Schild, Aaron, Sinop, Ali
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is noisy, unc
Externí odkaz:
http://arxiv.org/abs/2403.10640
Electric vehicle (EV) adoption in long-distance logistics faces challenges such as range anxiety and uneven distribution of charging stations. Two pivotal questions emerge: How can EVs be efficiently routed in a charging network considering range lim
Externí odkaz:
http://arxiv.org/abs/2311.05040
We study the problem of sampling a uniformly random directed rooted spanning tree, also known as an arborescence, from a possibly weighted directed graph. Classically, this problem has long been known to be polynomial-time solvable; the exact number
Externí odkaz:
http://arxiv.org/abs/2012.09502
For a function $\mathsf{K} : \mathbb{R}^{d} \times \mathbb{R}^{d} \to \mathbb{R}_{\geq 0}$, and a set $P = \{ x_1, \ldots, x_n\} \subset \mathbb{R}^d$ of $n$ points, the $\mathsf{K}$ graph $G_P$ of $P$ is the complete graph on $n$ nodes where the wei
Externí odkaz:
http://arxiv.org/abs/2011.02466
We present improved results for approximating maximum-weight independent set ($\MaxIS$) in the CONGEST and LOCAL models of distributed computing. Given an input graph, let $n$ and $\Delta$ be the number of nodes and maximum degree, respectively, and
Externí odkaz:
http://arxiv.org/abs/1906.11524
We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$, two designated vertices $s,t \in V$, and a budget $k$. The goal is to choose a subgraph of $G$ with
Externí odkaz:
http://arxiv.org/abs/1904.03219
The Capacitated Vehicle Routing problem is to find a minimum-cost set of tours that collectively cover clients in a graph, such that each tour starts and ends at a specified depot and is subject to a capacity bound on the number of clients it can ser
Externí odkaz:
http://arxiv.org/abs/1901.07032
In this paper we introduce the \emph{semi-online} model that generalizes the classical online computational model. The semi-online model postulates that the unknown future has a predictable part and an adversarial part; these parts can be arbitrarily
Externí odkaz:
http://arxiv.org/abs/1812.00134
Autor:
Schild, Aaron
Cheeger's inequality shows that any undirected graph $G$ with minimum nonzero normalized Laplacian eigenvalue $\lambda_G$ has a cut with conductance at most $O(\sqrt{\lambda_G})$. Qualitatively, Cheeger's inequality says that if the relaxation time o
Externí odkaz:
http://arxiv.org/abs/1811.10834
Autor:
Li, Huan, Schild, Aaron
We introduce a new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace. We show that sparsifiers with a near-linear number of edges in the dimension of the subspa
Externí odkaz:
http://arxiv.org/abs/1810.03224