scientific article; zbMATH DE number 5485528

MaRDI QIDQ3549697zbMATH OpenFDO

Authors Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna

Publication date 5 January 2009

Mathematics Subject Classification ID

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

Cited in

(18)

• A note on Rooted Survivable Networks
• A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems
• scientific article; zbMATH DE number 7651209 (Why is no real title available?)
• Black-box reductions for cost-sharing mechanism design
• Inapproximability of survivable networks
• Approximation algorithms and hardness of the \(k\)-route cut problem
• Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
• An improved approximation algorithm for minimum-cost subset k-connectivity (extended abstract)
• A note on iterated rounding for the survivable network design problem
• Approximating node-connectivity augmentation problems
• Black-box reductions for cost-sharing mechanism design
• Topology design for on-demand dual-path routing in wireless networks
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
• An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
• Survivable network design with group-to-group requirement
• scientific article; zbMATH DE number 7053371 (Why is no real title available?)
• Approximating fault-tolerant group-Steiner problems
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549697)