scientific article
From MaRDI portal
Publication:3165953
DOI10.4230/LIPICS.FSTTCS.2008.1747zbMath1248.68059MaRDI QIDQ3165953
Chandra Chekuri, Nitish Korula
Publication date: 19 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_9eb3.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (4)
A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems ⋮ A note on Rooted Survivable Networks ⋮ Approximating fault-tolerant group-Steiner problems ⋮ Prize-Collecting TSP with a Budget Constraint
This page was built for publication:
