On the maximum connectivity improvement problem

DOI10.1007/978-3-030-14094-6_4MaRDI QIDQ6051498zbMATH OpenOpenAlexFDO

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

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 programmingtreesapproximation algorithmssubmodularitygreedy algorithmsDAGgraph augmentation

Mathematics Subject Classification ID

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

Recommendations

• On the fixed-parameter tractability of the maximum connectivity improvement problem
• scientific article; zbMATH DE number 1300393
• Maximum betweenness centrality: approximability and tractable cases
• Algorithms for the constrained maximum-weight connected graph problem
• Connectivity interdiction

Cited in

(5)

• Connection problems in mountains and monotonic allocation schemes.
• scientific article; zbMATH DE number 4119945 (Why is no real title available?)
• A multivariate analysis of the strict terminal connection problem
• On the maximum betweenness improvement problem
• On the fixed-parameter tractability of the maximum connectivity improvement problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051498)