On the maximum connectivity improvement problem

DOI10.1007/978-3-030-14094-6_4zbMath1522.68397OpenAlexW2912105786MaRDI QIDQ6051498

Cristina M. Pinotti, Federico Corò, Gianlorenzo D'Angelo

Publication date: 20 October 2023

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-14094-6_4

zbMATH Keywords

dynamic programmingsubmodularitytreesapproximation algorithmsgraph augmentationgreedy algorithmsDAG

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

On the fixed-parameter tractability of the maximum connectivity improvement problem

This page was built for publication: On the maximum connectivity improvement problem