A spanning tree T of graph G is a ρ-approximate universal Steiner
tree (...
A t-spanner of a graph is a subgraph that t-approximates pairwise
distan...
Hop-constrained flows and their duals, moving cuts, are two fundamental
...
Reinforcement learning is hard in general. Yet, in many specific
environ...
We study how to vertex-sparsify a graph while preserving both the graph'...
Participatory budgeting is a method used by city governments to select p...
Embeddings of graphs into distributions of trees that preserve distances...
Network design problems aim to compute low-cost structures such as route...
In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
We study the store-and-forward packet routing problem for simultaneous
m...
In this paper we study how to optimally balance cheap inflexible resourc...
We demonstrate that the reverse greedy algorithm is a Θ(k)
approximation...
An organizational structure defines how an organization arranges and man...
The radio network model is a well-studied abstraction for modeling wirel...
Distributed graph algorithms that separately optimize for either the num...
Distributed graph algorithms that separately optimize for either the num...
The combinatorial explosion that plagues planning and reinforcement lear...