Better algorithms for minimum weight vertex-connectivity problems

DOI10.1007/BFb0023488zbMath1498.68198OpenAlexW1591249132MaRDI QIDQ5048953

Vincenzo Auletta

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0023488

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Connectivity (05C40)

Cites Work

• An application of submodular flows
• On the relationship between the biconnectivity augmentation and traveling salesman problems
• Approximation Algorithms for Graph Augmentation
• Augmentation Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Better algorithms for minimum weight vertex-connectivity problems