scientific article

zbMath1231.68177MaRDI QIDQ3549697

Julia Chuzhoy, Tanmoy Chakraborty, Sanjeev Khanna

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (16)

Unnamed Item ⋮ Unnamed Item ⋮ Approximating node-connectivity augmentation problems ⋮ Topology design for on-demand dual-path routing in wireless networks ⋮ A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems ⋮ Black-box reductions for cost-sharing mechanism design ⋮ An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem ⋮ An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity ⋮ Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ A note on Rooted Survivable Networks ⋮ Inapproximability of survivable networks ⋮ Approximating fault-tolerant group-Steiner problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: