scientific article; zbMATH DE number 5485528

zbMATH Open1231.68177MaRDI QIDQ3549697FDOQ3549697

Authors: Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna 

Publication date: 5 January 2009

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (17)

• A note on Rooted Survivable Networks
• A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems
• Title not available (Why is that?)
• Black-box reductions for cost-sharing mechanism design
• Approximation algorithms and hardness of the \(k\)-route cut problem
• Inapproximability of survivable networks
• 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
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
• Topology design for on-demand dual-path routing in wireless networks
• Title not available (Why is that?)
• An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
• 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)