We study the Densest Subgraph problem under the additional constraint of...
The classical ski-rental problem admits a textbook 2-competitive
determi...
One of the most important and well-studied settings for network design i...
While much of network design focuses mostly on cost (number or weight of...
The research area of algorithms with predictions has seen recent success...
A t-emulator of a graph G is a graph H that approximates its pairwise
sh...
The best known solutions for k-message broadcast in dynamic networks of
...
One of the most important and well-studied settings for network design i...
The spread of an epidemic is often modeled by an SIR random process on a...
A k-spanner of a graph G is a sparse subgraph that preserves its shortes...
A recent line of research investigates how algorithms can be augmented w...
Graph cut problems form a fundamental problem type in combinatorial
opti...
Recent work has established that, for every positive integer k, every
n-...
Recent work has pinned down the existentially optimal size bounds for ve...
It was recently shown that a version of the greedy algorithm gives a
con...
New optical technologies offer the ability to reconfigure network topolo...
We study three capacity problems in the mobile telephone model, a networ...
There has been significant recent progress on algorithms for approximati...
A t-spanner of a graph G is a subgraph H in which all distances are
pres...
The notion of policy regret in online learning is a well defined?
perfor...
Data structures that allow efficient distance estimation (distance oracl...
The minimum degree spanning tree (MDST) problem requires the constructio...
We consider the Shallow-Light Steiner Network problem from a fixed-param...