Node-weighted Network Design in Planar and Minor-closed Families of Graphs

DOI10.1145/3447959OpenAlexW3168881589MaRDI QIDQ5032022FDOQ5032022

Authors: Chandra Chekuri, Alina Ene, Ali Vakilian 

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.07616

Recommendations

• Node-weighted network design in planar and minor-closed families of graphs
• Primal-dual approximation algorithms for node-weighted network design in planar graphs
• Network Design with Weighted Degree Constraints
• Network design with weighted degree constraints
• Non-uniform robust network design in planar graphs
• scientific article; zbMATH DE number 2161745
• On the Structure of Minimum-Weight k-Connected Spanning Networks
• Survivable network design problems with weighted degree constraints
• Algorithms – ESA 2005
• Maximally weighted graph theoretic facilities design planning

zbMATH Keywords

approximation algorithmsnetwork designprimal-dual algorithmselement/vertex connectivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

This page was built for publication: Node-weighted Network Design in Planar and Minor-closed Families of Graphs

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