Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
From MaRDI portal
Publication:6638007
DOI10.4230/lipics.icalp.2023.15MaRDI QIDQ6638007
Logan Grout, Ishan Bansal, Sharat Ibrahimpur, J. Cheriyan
Publication date: 14 November 2024
primal-dual methodnetwork designapproximation algorithmsminimum cutsedge-connectivity of graphsf-connectivity problemflexible graph connectivitysmall cuts
Related Items (1)
This page was built for publication: Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions