3 citations · 3 across the 4 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Matching Augmentation via Simultaneous Contractions
Mohit Garg, Felix Hommelsheim, Nicole Megow
We consider the matching augmentation problem (MAP), where a matching of a graph needs to be extended into a -edge-connected spanning subgraph by adding the minimum number of ed…
cs.DS2022
Improved Approximation for Two-Edge-Connectivity
Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
The basic goal of survivable network design is to construct low-cost networks which preserve a sufficient level of connectivity despite the failure or removal of a few nodes or edg…