scientific article
From MaRDI portal
Publication:2934722
zbMath1302.90028MaRDI QIDQ2934722
Mohammad R. Salavatipour, Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Flows in graphs (05C21)
Related Items (11)
Approximation Algorithms for Buy-at-Bulk Geometric Network Design ⋮ Online Buy-at-Bulk Network Design ⋮ Approximation algorithms for orienting mixed graphs ⋮ Approximating some network design problems with node costs ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Approximability of Capacitated Network Design ⋮ Competitive cost sharing with economies of scale ⋮ Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph ⋮ Competitive Cost Sharing with Economies of Scale ⋮ Approximating Steiner Networks with Node Weights ⋮ Oblivious Buy-at-Bulk in Planar Graphs
This page was built for publication:
