Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques

Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem

Nicos Christofides · Operations Research Forum · 2022 · 1.1K citations · Full text

Computing, Computer Science, Algorithms +15

Augmenting graphs to meet edge-connectivity requirements

András Frank · 2002 · 217 citations

Natural Sciences, Computer Science, Mathematics +14

A matroid approach to finding edge connectivity and packing arborescences

Harold N. Gabow · 1991 · 200 citations

Computing, Visualization, Edge Computing +6

A fast algorithm for optimally increasing the edge-connectivity

Dalit Naor, Dan Gusfield, Charles U. Martel · 2002 · 64 citations

Computing, Computer Science, Algorithms +14

Biconnectivity approximations and graph carvings

Samir Khuller, Uzi Vishkin · 1992 · 26 citations · Full text

Computing, Computer Science, Mathematics +12