Publication:5417728
From MaRDI portal
zbMath1288.68266MaRDI QIDQ5417728
Ravishankar Krishnaswamy, R. Ravi, Anupam Gupta
Publication date: 22 May 2014
90C35: Programming involving graphs or networks
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
68W25: Approximation algorithms
Related Items
Unnamed Item, Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph, $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm, 2-node-connectivity network design, Approximating fault-tolerant group-Steiner problems, 2-node-connectivity network design, A polylogarithmic approximation algorithm for 2-edge-connected dominating set