2 citations · 2 across the 2 of their papers we have counts for
3 papers · 1 filter
Optimal Online Weighted Connectivity Augmentation
Mohit Garg, Felix Hommelsheim, Alexander Lindermayr
In the online Weighted Connectivity Augmentation Problem (WCAP), we are given a -edge-connected graph on vertices and a set of additional edges, called links, with nonnegati…
A -Approximation for Two-Edge Connectivity
Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni +3
The 2-Edge-Connected Spanning Subgraph problem (2ECSS) is among the most basic survivable network design problems: given an undirected and unweighted graph, the task is to find a s…
Two-Edge Connectivity via Pac-Man Gluing
Mohit Garg, Felix Hommelsheim, Alexander Lindermayr
We study the 2-edge-connected spanning subgraph (2-ECSS) problem: Given a graph , compute a connected subgraph of with the minimum number of edges such that is spann…