Approximation to the Minimum Cost Edge Installation Problem

DOI10.1007/978-3-540-77120-3_27zbMath1193.68287OpenAlexW2163898259MaRDI QIDQ5387765

Ehab Morsy, Hiroshi Nagamochi

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_27

zbMATH Keywords

Approximation algorithmRouting problemNetwork optimizationGraph algorithm

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 (2)

Approximation Schemes for Capacitated Geometric Network Design ⋮ Approximation Schemes for Capacitated Geometric Network Design

Cites Work

• Approximation algorithms for a capacitated network design problem
• Balancing minimum spanning trees and shortest-path trees
• Approximating the Single-Sink Link-Installation Problem in Network Design
• A constant factor approximation for the single sink edge installation problems
• Improved Approximation for Single-Sink Buy-at-Bulk
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation to the Minimum Cost Edge Installation Problem