Node connectivity augmentation via iterative randomized rounding
From MaRDI portal
Publication:6038664
DOI10.1007/s10107-022-01854-zarXiv2108.02041WikidataQ114228485 ScholiaQ114228485MaRDI QIDQ6038664
Laura Sanità, Haris Angelidakis, Dylan Hyatt-Denesik
Publication date: 2 May 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.02041
network design; approximation algorithms; Steiner tree; connectivity augmentation; iterative randomized rounding