scientific article
From MaRDI portal
Publication:2921762
zbMath1297.68019MaRDI QIDQ2921762
Anupam Gupta, Joseph (Seffi) Naor, Julia Chuzhoy, Amitabh Sinha
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
Online Priority Steiner Tree Problems ⋮ Approximability of Capacitated Network Design ⋮ Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph ⋮ The Priority k-Median Problem ⋮ Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees ⋮ On Capacitated Set Cover Problems ⋮ Approximability of capacitated network design
This page was built for publication:
