Degree Bounded Network Design with Metric Costs

DOI10.1137/090746495zbMath1235.05078OpenAlexW2155177580MaRDI QIDQ3096090

Wai Shing Fung, Lap Chi Lau, Chun Kong Yung, Yuk Hei Chan

Publication date: 7 November 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090746495

zbMATH Keywords

network designgraph connectivityedge splitting-off

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (4)

Approximating bounded-degree spanning trees and connected factors with leaves ⋮ Degree constrained node-connectivity problems ⋮ Approximation algorithms for connected graph factors of minimum weight ⋮ Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity

This page was built for publication: Degree Bounded Network Design with Metric Costs