Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs

DOI10.1007/978-3-642-31594-7_18zbMath1272.68331arXiv1910.07616OpenAlexW1494256302MaRDI QIDQ2843249

Ali Vakilian, Alina Ene, Chandra Chekuri

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ Online Node-weighted Steiner Forest and Extensions via Disk Paintings ⋮ Approximating node-weighted \(k\)-MST on planar graphs

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