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