Approximation algorithms for network design: A survey
A Gupta, J Könemann - Surveys in Operations Research and Management …, 2011 - Elsevier
Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …
and Theoretical Computer Science that focuses on problems arising in the realm of modern …
The complexity of optimal design of temporally connected graphs
We study the design of small cost temporally connected graphs, under various constraints.
We mainly consider undirected graphs of n vertices, where each edge has an associated set …
We mainly consider undirected graphs of n vertices, where each edge has an associated set …
Online node-weighted steiner tree and related problems
We obtain the first online algorithms for the node-weighted Steiner tree, Steiner forest and
group Steiner tree problems that achieve a poly-logarithmic competitive ratio. Our algorithm …
group Steiner tree problems that achieve a poly-logarithmic competitive ratio. Our algorithm …
Approximation algorithms for network design in non-uniform fault models
C Chekuri, R Jain - arXiv preprint arXiv:2403.15547, 2024 - arxiv.org
The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the
design of networks that are robust to faults under the assumption that any subset of edges …
design of networks that are robust to faults under the assumption that any subset of edges …
Beyond tree embeddings–a deterministic framework for network design with deadlines or delay
We consider network design problems with deadline or delay. All previous results for these
models are based on randomized embedding of the graph into a tree (HST) and then …
models are based on randomized embedding of the graph into a tree (HST) and then …
Nearly-tight lower bounds for set cover and network design with deadlines/delay
N Touitou - 32nd International Symposium on Algorithms and …, 2021 - drops.dagstuhl.de
In network design problems with deadlines/delay, an algorithm must make transmissions
over time to satisfy connectivity requests on a graph. To satisfy a request, a transmission …
over time to satisfy connectivity requests on a graph. To satisfy a request, a transmission …
Inferring social networks from outbreaks
We consider the problem of inferring the most likely social network given connectivity
constraints imposed by observations of outbreaks within the network. Given a set of vertices …
constraints imposed by observations of outbreaks within the network. Given a set of vertices …
Near-optimal algorithms for stochastic online bin packing
N Ayyadevara, R Dabas, A Khan… - arXiv preprint arXiv …, 2022 - arxiv.org
We study the online bin packing problem under two stochastic settings. In the bin packing
problem, we are given n items with sizes in (0, 1] and the goal is to pack them into the …
problem, we are given n items with sizes in (0, 1] and the goal is to pack them into the …
Online network design algorithms via hierarchical decompositions
S Umboh - Proceedings of the twenty-sixth annual ACM-SIAM …, 2014 - SIAM
We develop a new approach for online network design and obtain improved competitive
ratios for several problems. Our approach gives natural deterministic algorithms and simple …
ratios for several problems. Our approach gives natural deterministic algorithms and simple …
Your Mega-Constellations Can Be Slim: A Cost-Effective Approach for Constructing Survivable and Performant LEO Satellite Networks
Recently we have witnessed the active deployment of mega-constellations with hundreds to
thousands of low-earth orbit (LEO) satellites, targeting at constructing LEO satellite networks …
thousands of low-earth orbit (LEO) satellites, targeting at constructing LEO satellite networks …